Haselgrove; Leech and Trotter (Bounded Subgroup Index Coset Enumeration)

From Algorithm Wiki
Jump to navigation Jump to search

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