General number field 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 12:1412:14, 15 February 2023‎ Admin talk contribs‎ 403 bytes +403‎ Created page with "== Time Complexity == $O(exp(({1}+o({1})$)({64}n/{9})^{({1}/{3})}(log n)^{({2}/{3})}) heuristically? == Space Complexity == $O(n^{2/3})$ bits (http://www.ams.org/notices/199612/pomerance.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == http://www.ams.org/notices/199612/pomerance.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/General_number_field_sieve_(Second_Category_Integer_Factoring_Integer_Factoring)"