Dixon's algorithm (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‎ 643 bytes +643‎ Created page with "== Time Complexity == $O(e^{({2} \sqrt({2}) \sqrt(n*logn))}){4} == Space Complexity == $O(n+(B/logB)$^{2})? bits (There are pi(B) = O(B/log B) primes in the factor base; need pi(B)+1=O(B/log B) relations involving an integer (which doesn't need to be kept track of) and a pi(B)-bit string of exponents. Also need O(n) bits to perform other computations. Rest is irrelevant asymptotically) == Description == == Approximate? == Exact == Randomized? == No, deter..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Dixon%27s_algorithm_(Second_Category_Integer_Factoring_Integer_Factoring)"