LLL algorithm (Integer Relation Integer Relation)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses n auxiliary vectors each of length n, as well as an nxn matrix) == Description == Lattice-based == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://www.math.leidenuniv.nl/~hwl/PUBLICATIONS/1982f/art.pdf")
Time Complexity
$O(n^{4})$
Space Complexity
$O(n^{2})$ words
(Derived: Uses n auxiliary vectors each of length n, as well as an nxn matrix)
Description
Lattice-based
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1982
Reference
https://www.math.leidenuniv.nl/~hwl/PUBLICATIONS/1982f/art.pdf