Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration)

From Algorithm Wiki
Revision as of 09:42, 10 April 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 ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Haselgrove-Leech-Trotter_(HLT)_algorithm_(Coset_Enumeration_Coset_Enumeration)&oldid=47391"