Euler's factorization method (First Category Integer Factoring Integer Factoring)
Jump to navigation
Jump to search
Time Complexity
$O({2}^{(n/{2})})$
Space Complexity
$O(n)$ bits
(constant number of values which require at most O(n) bits)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1940
Reference
-