eCite Digital Repository

Implementation and analysis of the Todd-Coxeter algorithm

Citation

Cannon, JJ and Dimino, LA and Havas, G and Watson, JM, Implementation and analysis of the Todd-Coxeter algorithm, Mathematics of Computation, 27 pp. 463-490. ISSN 0025-5718 (1973) [Refereed Article]

Official URL: https://www.ams.org/journals/mcom/1973-27-123/S002...

DOI: doi:10.1090/S0025-5718-1973-0335610-5

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.

Item Details

Item Type:Refereed Article
Keywords:mathematics, co-set enumeration
Research Division:Mathematical Sciences
Research Group:Pure mathematics
Research Field:Group theory and generalisations
Objective Division:Expanding Knowledge
Objective Group:Expanding knowledge
Objective Field:Expanding knowledge in the mathematical sciences
UTAS Author:Watson, JM (Professor Jane Watson)
ID Code:137387
Year Published:1973
Web of Science® Times Cited:40
Deposited By:Office of the Faculty of Education
Deposited On:2020-02-11
Last Modified:2020-07-27
Downloads:0

Repository Staff Only: item control page