HJLS algorithm ( Integer Relation): 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.

28 April 2023

15 February 2023

  • curprev 11:3911:39, 15 February 2023‎ Admin talk contribs‎ 570 bytes +570‎ Created page with "== Time Complexity == $O(n^{3}(n+k)$) == Space Complexity == $O(n^{2})$ -- but requires infinite precision with large n or else it becomes unstable (Derived: Store Gram-Schmidt basis vectors b_i (n n-dimensional vectors) and Gram-Schmidt numbers \mu_{i,j} (i and j both from 1 to n), not sure how to take into account the "bit complexity" part) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == bit..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/HJLS_algorithm_(_Integer_Relation)"