Haselgrove-Leech-Trotter (HLT) algorithm (Coset Enumeration Coset Enumeration): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 April 2023

    • curprev 08:4208:42, 10 April 2023‎ Admin talk contribs‎ 387 bytes +387‎ 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 =="
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Haselgrove-Leech-Trotter_(HLT)_algorithm_(Coset_Enumeration_Coset_Enumeration)"