Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q821001> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Q821001 subject Q6425293.
- Q821001 subject Q6912449.
- Q821001 abstract "Template:ForIn mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields). The algorithm consists mainly of matrix reduction and polynomial GCD computations. It was invented by Elwyn Berlekamp in 1967. It was the dominant algorithm for solving the problem until the Cantor–Zassenhaus algorithm of 1981. It is currently implemented in many well-known computer algebra systems.".
- Q821001 wikiPageExternalLink factormod.
- Q821001 wikiPageExternalLink bstj46-8-1853.pdf.
- Q821001 wikiPageWikiLink Q1052579.
- Q821001 wikiPageWikiLink Q1314603.
- Q821001 wikiPageWikiLink Q131752.
- Q821001 wikiPageWikiLink Q1476663.
- Q821001 wikiPageWikiLink Q161172.
- Q821001 wikiPageWikiLink Q17457.
- Q821001 wikiPageWikiLink Q175515.
- Q821001 wikiPageWikiLink Q193794.
- Q821001 wikiPageWikiLink Q201339.
- Q821001 wikiPageWikiLink Q207006.
- Q821001 wikiPageWikiLink Q2091296.
- Q821001 wikiPageWikiLink Q230848.
- Q821001 wikiPageWikiLink Q2835780.
- Q821001 wikiPageWikiLink Q2914509.
- Q821001 wikiPageWikiLink Q392477.
- Q821001 wikiPageWikiLink Q395.
- Q821001 wikiPageWikiLink Q44337.
- Q821001 wikiPageWikiLink Q4883266.
- Q821001 wikiPageWikiLink Q5428743.
- Q821001 wikiPageWikiLink Q619436.
- Q821001 wikiPageWikiLink Q6425293.
- Q821001 wikiPageWikiLink Q657705.
- Q821001 wikiPageWikiLink Q6912449.
- Q821001 wikiPageWikiLink Q7581979.
- Q821001 wikiPageWikiLink Q82438.
- Q821001 wikiPageWikiLink Q830340.
- Q821001 wikiPageWikiLink Q864003.
- Q821001 wikiPageWikiLink Q867345.
- Q821001 comment "Template:ForIn mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields). The algorithm consists mainly of matrix reduction and polynomial GCD computations. It was invented by Elwyn Berlekamp in 1967. It was the dominant algorithm for solving the problem until the Cantor–Zassenhaus algorithm of 1981. It is currently implemented in many well-known computer algebra systems.".
- Q821001 label "Berlekamp's algorithm".