Algorithms, complexity and discreteness criteria in PSL(2, C)

Journal d'Analyse Mathematique

Volumn 73, Issue , 1997, Pages 91-114

  Gilman, Jane ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031441212     PISSN: 00217670     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02788139     Document Type: Article

References (18)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. L. Blum, M. Shub and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21, (1989), 1-46.
3. A. Borodin and L. Munro, The Computational Complexity of Algebraic and Numeric Problems, Theory of Computation Series 1, Elsevier, New York, 1975.
4. G. E. Collins, Computer algebra of polynomials and rational functions, Amer. Math. Monthly 80/7 (1973), 725-755.
5. G. E. Collins and R. Loos, Real zeros of polynomials, in Computer Algebra: Symbolic and Algebraic Computation (B. Buchburger, G. E. Collins and R. Loos, eds.), Springer-Verlag, New York, 1983.
6. J. Gilman, Two-generator discrete subgroups of PSL(2, R), Mem. Amer. Math. Soc. 117, No. 561 (1995).
7. J. Gilman and B. Maskit, An algorithm for two-generator discrete groups, Michigan Math. J. 38 (1991), 13-32.
8. T. Jørgensen, On discrete groups of Mobius transformations, Amer. J. Math. 98 (1976), 739-749.
9. E. Kaltofen, Factorization of polynomials, in Computer Algebra: Symbolic and Algebraic Computation (B. Buchburger, G. E. Collins and R. Loos, eds.), Springer-Verlag, New York, 1983.
10. R. Loos, Computing in algebraic extensions, in Computer Algebra: Symbolic and Algebraic Computation (B. Buchberger, C. E. Collins and R. Loos, eds.), Springer-Verlag, New York, 1983.
11. R. Loos, Generalized polynomial remainder sequences, in Computer Algebra: Symbolic and Algebraic Computation (B. Buchberger, C. E. Collins and R. Loos, eds.), Springer-Verlag, New York, 1983.
12. R. Loos, Computing rational zeros of integral polynomials by p-adic expansion, SIAM J. Comput. 12 (1983), 286-293.
13. J. P. Matelski, The classification of discrete 2-generator subgroups of PSL(2,R), Israel J. Math. 42 (1982), 309-317.
14. I. Niven, Numbers: Rational and Irrational, Mathematical Association of America, 1961.
15. R. Riley, Applications of a computer implementation of Poincaré's theorem on fundamental polyhedra, Math. Comp. 40 (1983), 633-646.
16. R. Riley, In preparation.
17. G. Rosenberger, All generating pairs of all two-generator Fuchsian groups, Arch. Math. 46 (1986), 198-204.
18. S. Winograd, Arithmetic Complexity of Computations, CBMS-NSF Series in Applied Math, 33, Philadelphia, 1980.