Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/practical-method-for-enumerating-cosets-of-a-finite-abstract-group/030657...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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/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/w/index.php?title=Todd–Coxeter_algorithm_(Bounded_Subgroup_Index_Coset_Enumeration)&oldid=45355"