Rational sieve (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‎ 424 bytes +424‎ Created page with "== Time Complexity == $O(e^{sqrt(({2}+o({1})$)n*logn)}) == Space Complexity == $O(n+(B/logB)$^{2})? bits (Same general approach as Dixon's algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1993 == Reference == https://www.ams.org/journals/mcom/1993-61-203/S0025-5718-1993-1182953-4/S0025-5718-1993-1182953-4.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Rational_sieve_(Second_Category_Integer_Factoring_Integer_Factoring)"