No label defined (Q4133833)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3558082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3558082 |
Statements
1977
0 references
0.8153379559516907
0 references
0.8110289573669434
0 references
[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.
0 references