Trial division (First 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 == $O({2}^{n/2})$ == Space Complexity == $O(n)$ auxiliary bits (need to keep track of what number you're currently checking) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1202 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^{n/2})$

Space Complexity

$O(n)$ auxiliary bits

(need to keep track of what number you're currently checking)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1202

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Trial_division_(First_Category_Integer_Factoring_Integer_Factoring)&oldid=44628"