Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cantor–Zassenhaus_algorithm> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Cantor–Zassenhaus_algorithm abstract "In computational algebra, the Cantor–Zassenhaus algorithm is a well known method for factorising polynomials over finite fields (also called Galois fields).The algorithm consists mainly of exponentiation and polynomial GCD computations. It was invented by D. Cantor and Hans Zassenhaus in 1981.It is arguably the dominant algorithm for solving the problem, having replaced the earlier Berlekamp's algorithm of 1967. It is currently implemented in many well-known computer algebra systems, including PARI/GP.".
- Cantor–Zassenhaus_algorithm wikiPageID "6059689".
- Cantor–Zassenhaus_algorithm wikiPageRevisionID "595111050".
- Cantor–Zassenhaus_algorithm subject Category:Computer_algebra.
- Cantor–Zassenhaus_algorithm subject Category:Finite_fields.
- Cantor–Zassenhaus_algorithm comment "In computational algebra, the Cantor–Zassenhaus algorithm is a well known method for factorising polynomials over finite fields (also called Galois fields).The algorithm consists mainly of exponentiation and polynomial GCD computations. It was invented by D. Cantor and Hans Zassenhaus in 1981.It is arguably the dominant algorithm for solving the problem, having replaced the earlier Berlekamp's algorithm of 1967.".
- Cantor–Zassenhaus_algorithm label "Algorithme de Cantor-Zassenhaus".
- Cantor–Zassenhaus_algorithm label "Cantor–Zassenhaus algorithm".
- Cantor–Zassenhaus_algorithm sameAs Cantor%E2%80%93Zassenhaus_algorithm.
- Cantor–Zassenhaus_algorithm sameAs Algorithme_de_Cantor-Zassenhaus.
- Cantor–Zassenhaus_algorithm sameAs Q2835780.
- Cantor–Zassenhaus_algorithm sameAs Q2835780.
- Cantor–Zassenhaus_algorithm wasDerivedFrom Cantor–Zassenhaus_algorithm?oldid=595111050.