Todd–Coxeter algorithm (Coset Enumeration Coset Enumeration)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

$O(gkc)$ words

(Defines O(k) tables, each with O(g) columns and O(c) rows)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1936

Reference

https://www-cambridge-org.ezproxy.canberra.edu.au/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/practical-method-for-enumerating-cosets-of-a-finite-abstract-group/0306574AD958F694A0A8339338348AA1

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Todd–Coxeter_algorithm_(Coset_Enumeration_Coset_Enumeration)&oldid=47390"