Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6231
Title: Efficient Average-Case Algorithms for the Modular Group
Authors: Kozen, Dexter
Keywords: computer science
technical report
Issue Date: Apr-1994
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1445
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].
URI: http://hdl.handle.net/1813/6231
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
94-1445.pdf280.05 kBAdobe PDFView/Open
94-1445.ps321.36 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us