Pollard's rho algorithm (First Category Integer Factoring Integer Factoring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == - == Space Complexity == $O(n)$ auxiliary bits (keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1975 == Reference == https://link.springer.com/article/10.1007%2FBF01933667") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ bits | ||
(keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space)) | (keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space)) | ||
Latest revision as of 08:55, 10 April 2023
Time Complexity
-
Space Complexity
$O(n)$ bits
(keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1975