scientific article; zbMATH DE number 3558082
From MaRDI portal
Publication:4133833
[This article was published in the book announced in this Zbl 0342.00008.] A convenient algorithm for use in many machine computations on groups is the Todd-Coxeter algorithm for enumeration of cosets. It is of course important to make the actual computations performed by the machine as efficient as possible. In particular it has been asked whether it was sufficient to ensure that each coset appeared at the beginning of every row in the relator table rather than in every essentially different place. This paper gives two examples to show that it is not.
Recommendations
Cited in
(11)- On doing Todd-Coxeter coset enumeration in parallel
- Experiments in coset enumeration.
- scientific article; zbMATH DE number 3886105 (Why is no real title available?)
- Use of computers in solving well-known algebra problems
- scientific article; zbMATH DE number 3904827 (Why is no real title available?)
- scientific article; zbMATH DE number 3906730 (Why is no real title available?)
- scientific article; zbMATH DE number 4004456 (Why is no real title available?)
- An enumeration process for racks
- scientific article; zbMATH DE number 784869 (Why is no real title available?)
- scientific article; zbMATH DE number 784870 (Why is no real title available?)
- The Todd-Coxeter algorithm for semigroups and monoids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133833)