Geodesic
Polynomial complexity of the Gilman-Maskit discreteness algorithm
Yicheng Jiang1
1Rutgers University
Annales Fennici Mathematici, Tome 26 (2001) no. 2, pp. 375-390
Cet article a éte moissonné depuis la source Journal.fi

Voir la notice de l'article

Yicheng Jiang  1

1 Rutgers University 
@article{AFM_2001_26_2_a4,
     author = {Yicheng Jiang},
     title = {Polynomial complexity of the {Gilman-Maskit} discreteness algorithm},
     journal = {Annales Fennici Mathematici},
     pages = {375--390},
     year = {2001},
     volume = {26},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/AFM_2001_26_2_a4/}
}
TY  - JOUR
AU  - Yicheng Jiang
TI  - Polynomial complexity of the Gilman-Maskit discreteness algorithm
JO  - Annales Fennici Mathematici
PY  - 2001
SP  - 375
EP  - 390
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/AFM_2001_26_2_a4/
LA  - en
ID  - AFM_2001_26_2_a4
ER  - 
%0 Journal Article
%A Yicheng Jiang
%T Polynomial complexity of the Gilman-Maskit discreteness algorithm
%J Annales Fennici Mathematici
%D 2001
%P 375-390
%V 26
%N 2
%U http://geodesic.mathdoc.fr/item/AFM_2001_26_2_a4/
%G en
%F AFM_2001_26_2_a4
Yicheng Jiang. Polynomial complexity of the Gilman-Maskit discreteness algorithm. Annales Fennici Mathematici, Tome 26 (2001) no. 2, pp. 375-390. http://geodesic.mathdoc.fr/item/AFM_2001_26_2_a4/