About: Berlekamp–Rabin algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Berlekamp–Rabin algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over a field . 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.

Attributes	Values
rdfs:label	Berlekamp–Rabin algorithm (en)
rdfs:comment	In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over a field . 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. (en)
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description dbt:Number-theoretic_algorithms
Subject	Algebra Algorithms Polynomials Number theoretic algorithms
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Berlekamp–Rabin_algorithm?oldid=1037439210&ns=0
Wikipage page ID	61379828 (xsd:integer)
page length (characters) of wiki page	11521 (xsd:nonNegativeInteger)
Wikipage revision ID	1037439210 (xsd:integer)
Link from a Wikipage to another Wikipage	Number theory Root-finding algorithms Berlekamp's algorithm Binomial theorem Monomial Algebra Algorithms Polynomials Number theoretic algorithms Quadratic residue Primitive polynomial (field theory) Correctness (computer science) Michael O. Rabin Elwyn Berlekamp Finite field Exponentiation by squaring Fast Fourier transform Euclidean algorithm Euler's criterion Polynomial Polynomial greatest common divisor Randomized algorithm dbr:Theory_of_cyclotomy
has abstract	In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over a field . 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Berlekamp–Rabin_algorithm
is Wikipage redirect of	Berlekamp's root finding algorithm Berlekamp-Rabin algorithm
is Link from a Wikipage to another Wikipage of	Berlekamp's root finding algorithm Berlekamp-Rabin algorithm List of algorithms
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Berlekamp–Rabin_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software