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

From Algorithm Wiki
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