Efficient Average-Case Algorithms for the Modular Group

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/6231
Collections
Metadata
Show full item record
Author
Kozen, Dexter
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 [FOCS 1990].
Date Issued
1994-04
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1445
Type
technical report

Statistics