Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(ng)$? words (Implementation stores a table whose number of required registers is the product of the number of generators (n) and the number of cosets (O(g))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference ==")
Time Complexity
$O({2}^n)$
Space Complexity
$O(ng)$? words
(Implementation stores a table whose number of required registers is the product of the number of generators (n) and the number of cosets (O(g)))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1940