PSLQ algorithm (Integer Relation Integer Relation)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses multiple nxn auxiliary matrices) == Description == Partial Sum of Squares using QR decomposition == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1992 == Reference == https://www.ams.org/journals/mcom/1999-68-225/S0025-5718-99-00995-3/S0025-5718-99-00995-3.pdf")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ words
(Derived: Uses multiple nxn auxiliary matrices)
Description
Partial Sum of Squares using QR decomposition
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1992
Reference
https://www.ams.org/journals/mcom/1999-68-225/S0025-5718-99-00995-3/S0025-5718-99-00995-3.pdf