Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring)
Revision as of 11:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(e^{\sqrt({2}n*logn)})$ == Space Complexity == $O(n+(B/logB)$^{2})? bits (Same as above? assuming there is a bound parameter implemented) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1931 == Reference == https://www.ams.org/journals/bull/1931-37-10/S0002-9904-1931-05271-X/home.html")
Time Complexity
$O(e^{\sqrt({2}n*logn)})$
Space Complexity
$O(n+(B/logB)$^{2})? bits
(Same as above? assuming there is a bound parameter implemented)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1931
Reference
https://www.ams.org/journals/bull/1931-37-10/S0002-9904-1931-05271-X/home.html