文章基本信息
- 标题：Efficient Average-Case Algorithms for the Modular Group
- 本地全文：下载
- 作者：Jin-Yi Cai ; W. H. J. Fuchs ; Dexter Kozen 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：1994
- 卷号：1994
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
The modular group occupies a central position in many branches ofmathematical sciences. In this paper we give average polynomial-timealgorithms for the unbounded and bounded membership problems forfinitely generated subgroups of the modular group. The latter resultaffirms a conjecture of Gurevich.
- 关键词：average casehardness; average polynomial-time algorithms; the modular group
