Polynomial complexity of the Gilman-Maskit discreteness algorithm.

Jiang, Yicheng

Annales Academiae Scientiarum Fennicae. Mathematica (2001)

  • Volume: 26, Issue: 2, page 375-390
  • ISSN: 1239-629X

How to cite

top

Jiang, Yicheng. "Polynomial complexity of the Gilman-Maskit discreteness algorithm.." Annales Academiae Scientiarum Fennicae. Mathematica 26.2 (2001): 375-390. <http://eudml.org/doc/122260>.

@article{Jiang2001,
author = {Jiang, Yicheng},
journal = {Annales Academiae Scientiarum Fennicae. Mathematica},
language = {eng},
number = {2},
pages = {375-390},
publisher = {Finnish Academy of Science and Letters, Helsinki; Finnish Society of Sciences and Letters},
title = {Polynomial complexity of the Gilman-Maskit discreteness algorithm.},
url = {http://eudml.org/doc/122260},
volume = {26},
year = {2001},
}

TY - JOUR
AU - Jiang, Yicheng
TI - Polynomial complexity of the Gilman-Maskit discreteness algorithm.
JO - Annales Academiae Scientiarum Fennicae. Mathematica
PY - 2001
PB - Finnish Academy of Science and Letters, Helsinki; Finnish Society of Sciences and Letters
VL - 26
IS - 2
SP - 375
EP - 390
LA - eng
UR - http://eudml.org/doc/122260
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.