Cantor–Zassenhaus algorithm
In computational algebra, the Cantor–Zassenhaus algorithm is a method for factoring polynomials over finite fields (also called Galois fields). The algorithm consists mainly of exponentiation and polynomial GCD computations. It was invented by David G. 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 computer algebra systems.
primaryTopic
Cantor–Zassenhaus algorithm
In computational algebra, the Cantor–Zassenhaus algorithm is a method for factoring polynomials over finite fields (also called Galois fields). The algorithm consists mainly of exponentiation and polynomial GCD computations. It was invented by David G. 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 computer algebra systems.
has abstract
Algorytm Cantora-Zassenhausa – ...... ra i Hansa Zassenhausa w 1981.
@pl
In computational algebra, the ...... many computer algebra systems.
@en
L'algorithme de Cantor-Zassenh ...... e Berlekamp, qui date de 1967.
@fr
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,022,567,308
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Algorytm Cantora-Zassenhausa – ...... ra i Hansa Zassenhausa w 1981.
@pl
In computational algebra, the ...... many computer algebra systems.
@en
L'algorithme de Cantor-Zassenh ...... e Berlekamp, qui date de 1967.
@fr
label
Algorithme de Cantor-Zassenhaus
@fr
Algorytm Cantora-Zassenhausa
@pl
Cantor–Zassenhaus algorithm
@en