Title :
Efficient average-case algorithms for the modular group
Author :
Cai, Jin-Yi ; Fuchs, Wolfgang H. ; Kozen, Dexter ; Zicheng Lui
Author_Institution :
State Univ. of New York, Buffalo, NY, USA
Abstract :
The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated subgroups of the modular group. The latter result affirms a conjecture of Y. Gurevich (1990)
Keywords :
computational complexity; average polynomial-time algorithms; average-case algorithms; bounded membership; finitely generated subgroups; mathematical sciences; modular group; unbounded membership; Algorithm design and analysis; Character generation; Computer applications; Elliptic curves; Geometry; Lattices; Linear programming; Optical design; Polynomials;
Conference_Titel :
Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Conference_Location :
Santa Fe, NM
Print_ISBN :
0-8186-6580-7
DOI :
10.1109/SFCS.1994.365698
