Template:Number-theoretic algorithms: Difference between revisions

Revision as of 12:44, 13 September 2019

Latest revision as of 06:37, 8 May 2025

(18 intermediate revisions by 13 users not shown)

Line 26:

* [[Sieve of Atkin]]

* [[Sieve of Eratosthenes]]

* [[Sieve of Pritchard]]

* [[Sieve of Sundaram]]

* [[Wheel factorization]]

Line 88 ⟶ 89:

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

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

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

Line 97 ⟶ 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 113 ⟶ 115:

[[Category:Computer science navigational boxes]]

[[Category:MathematicsNumber theory navigational boxes]]

}}

</noinclude>