Template:Number-theoretic algorithms: Difference between revisions

Content deleted Content added
doc in green box
 
(24 intermediate revisions by 15 users not shown)
Line 26:
* [[Sieve of Atkin]]
* [[Sieve of Eratosthenes]]
* [[Sieve of Pritchard]]
* [[Sieve of Sundaram]]
* [[Wheel factorization]]
Line 56 ⟶ 57:
* [[Fürer's algorithm|Fürer's]]
 
| group5 = [[DiscreteEuclidean logarithmdivision|Euclidean]] [[Division algorithm|division]]
| list5 =
* [[Binary division|Binary]]
* [[Chunking (division)|Chunking]]
* [[Fourier division|Fourier]]
* [[Goldschmidt division|Goldschmidt]]
* [[Newton–Raphson division|Newton-Raphson]]
* [[Long division|Long]]
* [[Short division|Short]]
* [[SRT division|SRT]]
 
| group6 = [[Discrete logarithm]]
| list6 =
* [[Baby-step giant-step]]
* [[Pollard's rho algorithm for logarithms|Pollard rho]]
Line 65 ⟶ 77:
* [[Function field sieve]]
 
| group6group7 = [[Greatest common divisor]]
| list6list7 =
* [[Binary GCD algorithm|Binary]]
* [[Euclidean algorithm|Euclidean]]
Line 72 ⟶ 84:
* [[Lehmer's GCD algorithm|Lehmer's]]
 
| group7group8 = [[Quadratic residue|Modular square root]]
| list7list8 =
* [[Cipolla's algorithm|Cipolla]]
* [[Pocklington's algorithm|Pocklington's]]
* [[Tonelli–Shanks algorithm|Tonelli–Shanks]]
* [[Berlekamp–Rabin algorithm|Berlekamp]]
 
 
| group8group9 = Other algorithms
| list8list9 =
* [[Chakravala method|Chakravala]]
* [[Cornacchia's algorithm|Cornacchia]]
* [[Exponentiation by squaring]]
* [[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|LLL]]
* [[Integer square root]]
* [[Integer relation algorithm|Integer relation]] ([[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|LLL]]; [[Korkine–Zolotarev lattice basis reduction algorithm|KZ]])
* [[Modular exponentiation]]
* [[Montgomery reduction]]
* [[Schoof's algorithm|Schoof's]]
* [[Trachtenberg system]]
 
 
Line 100 ⟶ 115:
 
[[Category:Computer science navigational boxes]]
[[Category:MathematicsNumber theory navigational boxes]]
}}
</noinclude>