Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3811:38, 15 February 2023‎ Admin talk contribs‎ 413 bytes +413‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Continued_fraction_factorization_(CFRAC)_(Second_Category_Integer_Factoring_Integer_Factoring)"