Template:Number-theoretic algorithms: Difference between revisions

Revision as of 13:00, 24 November 2021

Latest revision as of 06:37, 8 May 2025

(4 intermediate revisions by 4 users not shown)

Line 26:

* [[Sieve of Atkin]]

* [[Sieve of Eratosthenes]]

* [[Sieve of Pritchard]]

* [[Sieve of Sundaram]]

* [[Wheel factorization]]

Line 89 ⟶ 90:

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

* [[Berlekamp–Rabin algorithm|Berlekamp]]

* [[Kunerth's algorithm|Kunerth]]

Line 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]]

* [[Trachtenberg system]]

Line 114 ⟶ 115:

[[Category:Computer science navigational boxes]]

[[Category:MathematicsNumber theory navigational boxes]]

}}

</noinclude>