Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

Implementation and analysis of the Todd-Coxeter algorithm


Authors: John J. Cannon, Lucien A. Dimino, George Havas and Jane M. Watson
Journal: Math. Comp. 27 (1973), 463-490
MSC: Primary 20-04
MathSciNet review: 0335610
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A recent form of the Todd-Coxeter algorithm, known as the lookahead algorithm, is described. The time and space requirements for this algorithm are shown experimentally to be usually either equivalent or superior to the Felsch and Haselgrove-Leech-Trotter algorithms. Some findings from an experimental study of the behaviour of Todd-Coxeter programs in a variety of situations are given.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 20-04

Retrieve articles in all journals with MSC: 20-04


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1973-0335610-5
PII: S 0025-5718(1973)0335610-5
Keywords: Todd-Coxeter algorithm, generators and relations, group theory
Article copyright: © Copyright 1973 American Mathematical Society