HJLS algorithm ( Integer Relation)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3}(n+k))$
Space Complexity
$O(n^{2})$ -- but requires infinite precision with large n or else it becomes unstable bits
(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 complexity
Year
1986