Todd–Coxeter algorithm (Coset Enumeration Coset Enumeration): Difference between revisions
Jump to navigation
Jump to search
(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...") |
(No difference)
|
Latest revision as of 09:42, 10 April 2023
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