Skip to search formSkip to main contentSkip to account menu

Cantor–Zassenhaus algorithm

Known as: Cantor-Zassenhaus, Cantor-Zassenhaus Algorithm, Cantor–Zassenhaus 
In computational algebra, the Cantor–Zassenhaus algorithm is a well known method for factorising polynomials over finite fields (also called Galois… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Berlekamp's algorithmComputational mathematicsComputer algebra systemDiscrete logarithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A formalization of the Berlekamp-Zassenhaus factorization algorithm
We formalize the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt… 
2015
2015
Combinatorial Techniques in the Galois Theory of $p$-Extensions
A major open problem in current Galois theory is to characterize those profinite groups which appear as absolute Galois groups of… 
2015
2015
Galois 2-Extensions
The inverse Galois problem is a major question in mathematics. For a given base field F and a given finite group G, one would… 
Review
2014
Review
2014
Structure vs Combinatorics in Computational Complexity
  • B. Barak
  • Bull. EATCS
  • 2014
  • Corpus ID: 1657528
Some computational problems seem to have a certain \structure" that is manifested in non-trivial algorithmic properties, while… 
2014
2014
SOME EXAMPLES OF FAB AND MILD PRO-p-GROUPS WITH TRIVIAL CUP-PRODUCT
Let $\G_S$ be the Galois group of the maximal pro-$p$-extension $\Q_S$ of $\Q$ unramified outside a finite set $S$ of places of… 
2014
2014
Cohomology of Absolute Galois Groups
The main problem this thesis deals with is the characterization of profinite groups which are realizable as absolute Galois… 
2014
2014
A Sylow theorem for the integral group ring of PSL(2,q)
2014
2014
Dimensions of Zassenhaus filtration subquotients of some pro-p-groups
We compute the Fp-dimension of an n-th graded piece G(n)/G(n+1) of the Zassenhaus filtration for various finitely generated pro-p… 
Review
1998
Review
1998
Univariate Polynomial Factorization Over Finite Fields
1997
1997
A generalisation of the Cantor-Zassenhaus algorithm
We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)