Factorization/Integer
< FactorizationMethods
see the Wikipedia article on factoring algorithms.
Special-purpose
A special-purpose factoring algorithm's running time depends on the properties of the number to be factored or on one of its unknown factors: size, special form, etc.
- Trial division (Wikipedia)
- Wheel (Wikipedia)
- Pollard's rho (Wikipedia)
- Algebraic-group factorisation algorithms (Wikipedia)
General-purpose
- Dixon (Wikipedia)
- Continued fraction (Wikipedia)
- Quadratic sieve (Wikipedia)
- Rational sieve (Wikipedia)
- General number field sieve (Wikipedia)
- Shanks' square forms (Wikipedia)
Other notable
- Shor, for quantum computers ((Wikipedia)
Proposed
Linked pages here may involve original research, may contain errors. They should be attributed to the author, explicitly.
- Deduction, created by SHAWWPG19410425.
This article is issued from Wikiversity - version of the Monday, March 17, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.