This HTML5 document contains 38 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Berlekamp–Rabin_algorithm
rdfs:label
Berlekamp–Rabin algorithm
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.
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Number-theoretic_algorithms
dct:subject
dbc:Algebra dbc:Polynomials dbc:Algorithms dbc:Number_theoretic_algorithms
prov:wasDerivedFrom
n6:Berlekamp–Rabin_algorithm?oldid=1037439210&ns=0
dbo:wikiPageID
61379828
dbo:wikiPageLength
11521
dbo:wikiPageRevisionID
1037439210
dbo:wikiPageWikiLink
dbr:Primitive_polynomial_(field_theory) dbr:Monomial dbr:Exponentiation_by_squaring dbc:Polynomials dbc:Algorithms dbr:Polynomial dbr:Correctness_(computer_science) dbr:Root-finding_algorithms dbr:Randomized_algorithm dbr:Berlekamp's_algorithm dbr:Michael_O._Rabin dbr:Fast_Fourier_transform dbc:Number_theoretic_algorithms dbc:Algebra dbr:Binomial_theorem dbr:Finite_field dbr:Euclidean_algorithm dbr:Elwyn_Berlekamp dbr:Quadratic_residue dbr:Theory_of_cyclotomy dbr:Euler's_criterion dbr:Polynomial_greatest_common_divisor dbr:Number_theory
dbo: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.
foaf:isPrimaryTopicOf
n6:Berlekamp–Rabin_algorithm