Rational sieve (Second Category Integer Factoring Integer Factoring)
Jump to navigation
Jump to search
Time Complexity
$O(e^{sqrt(({2}+o({1})$)n*logn)})
Space Complexity
$O(n+(B/logB)$^{2})? bits
(Same general approach as Dixon's algorithm)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1993