Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR94-016 | 12th December 1994 00:00

Efficient Average-Case Algorithms for the Modular Group

RSS-Feed




TR94-016
Authors: Jin-Yi Cai, W. H. J. Fuchs, Dexter Kozen, Zicheng Liu
Publication: 12th December 1994 00:00
Downloads: 1343
Keywords: 


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 Gurevich.



ISSN 1433-8092 | Imprint