Quadratic sieve (Second Category Integer Factoring Integer Factoring)

From Algorithm Wiki
Revision as of 11:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == - == 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 == 1981 == Reference == https://www.semanticscholar.org/paper/Analysis-and-comparison-of-some-integer-factoring-Pomerance/134b7b065a73d4ca00bb16c7b8bebbde951b0ba0")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

-

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

1981

Reference

https://www.semanticscholar.org/paper/Analysis-and-comparison-of-some-integer-factoring-Pomerance/134b7b065a73d4ca00bb16c7b8bebbde951b0ba0

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Quadratic_sieve_(Second_Category_Integer_Factoring_Integer_Factoring)&oldid=44638"