next up previous contents
Next: Primality Testing Up: Prime Numbers Previous: Largest Fermat number with

Algorithms to factor integer numbers

There are several known algorithms that have subexponential estimated running time, to mention just a few:


A.K. Lenstra, H.W. Lenstra Jr. Algorithms in Number Theory. J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity Elsevier, pp. 673-715, 1990.

Alex Lopez-Ortiz
Mon Feb 23 16:26:48 EST 1998