General number field sieve (Second Category Integer Factoring Integer Factoring)
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (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")
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