Polynomial complexity of the Gilman-Maskit discreteness algorithm.
Jiang, Yicheng
Annales Academiae Scientiarum Fennicae. Mathematica, Tome 26 (2001), p. 375-390 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:122260 
@article{01760347,
     title = {Polynomial complexity of the Gilman-Maskit discreteness algorithm.},
     journal = {Annales Academiae Scientiarum Fennicae. Mathematica},
     volume = {26},
     year = {2001},
     pages = {375-390},
     zbl = {1002.30023},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01760347}
}

Jiang, Yicheng. Polynomial complexity of the Gilman-Maskit discreteness algorithm.. Annales Academiae Scientiarum Fennicae. Mathematica, Tome 26 (2001) pp. 375-390. http://gdmltest.u-ga.fr/item/01760347/