Template:Number-theoretic algorithms: Difference between revisions

Revision as of 01:41, 13 September 2019

Latest revision as of 06:37, 8 May 2025

(20 intermediate revisions by 14 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 = [[Euclidean division|Euclidean]] [[Division algorithm|Divisiondivision]]

| list5 =

* [[Binary division|Binary]]

* [[Chunking (division)|Chunking]]

* [[Fourier division|Fourier]]

Line 87 ⟶ 89:

* [[Pocklington's algorithm|Pocklington's]]

* [[Tonelli–Shanks algorithm|Tonelli–Shanks]]

* [[Berlekamp's root findingBerlekamp–Rabin algorithm|Berlekamp]]

Line 96 ⟶ 98:

* [[Exponentiation by squaring]]

* [[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 112 ⟶ 115:

[[Category:Computer science navigational boxes]]

[[Category:MathematicsNumber theory navigational boxes]]

}}

</noinclude>