Fermat's factorization method (First Category Integer Factoring Integer Factoring)

From Algorithm Wiki

Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

$O(n)$? bits

(constant number of values which require at most O(n) bits)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1894

Reference

https://archive.org/details/oeuvresdefermat02ferm

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fermat%27s_factorization_method_(First_Category_Integer_Factoring_Integer_Factoring)&oldid=46990"