go-v.orgcodex
Menu
Page tools

codex · Philosophy

Berlekamp–Rabin algorithm

Diagram for Berlekamp–Rabin algorithm
In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over the field 𝔽p with p elements. The method was discovered by Elwyn Berlekamp in 1970 as an auxiliary to the algorithm for polynomial factori · image: Wikimedia Commons

In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over the field 𝔽p with p elements. The method was discovered by Elwyn Berlekamp in 1970 as an auxiliary to the algorithm for polynomial factorization over finite fields. The algorithm was later modified by Rabin for arbitrary finite fields in 1979. The method was also independently discovered before Berlekamp by other researchers.

Wikipedia contributors, "Berlekamp–Rabin algorithm", Wikipedia, revision 1296403975, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex