Polynomial complexity of the Gilman-Maskit discreteness algorithm

Authors

  • Yicheng Jiang Rutgers University
Issue
Vol. 26 No. 2 (2001): Volume 26, 2001
Section
Article

Published

2001-08-01

How to Cite

Jiang, Y. (2001). Polynomial complexity of the Gilman-Maskit discreteness algorithm. Annales Fennici Mathematici, 26(2), 375–390. Retrieved from https://afm.journal.fi/article/view/135011

Copyright (c) 2001 The Finnish Mathematical Society

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.