Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration)
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