Todd–Coxeter algorithm

E1944493 UNEXPLORED

The Todd–Coxeter algorithm is a procedure in computational group theory used to enumerate the cosets of a subgroup in a finitely presented group.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
Todd–Coxeter algorithm canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

John A. Todd → notableWork → Todd–Coxeter algorithm ⓘ