Deterministic distinct-degree factorization of polynomials over finite fields

A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987.

[1]  Erich Kaltofen,et al.  Deterministic Irreducibility Testing of Polynomials over Large Finite Fields , 1987, J. Symb. Comput..

[2]  Kazuhiro Yokoyama,et al.  Yet another practical implementation of polynomial factorization over finite fields , 2002, ISSAC '02.

[3]  Rudolf Lide,et al.  Finite fields , 1983 .

[4]  W. S. Brown,et al.  On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.

[5]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[6]  Shuhong Gao,et al.  Hensel lifting and bivariate polynomial factorisation over finite fields , 2002, Math. Comput..

[7]  Shuhong Gao,et al.  Factoring multivariate polynomials via partial differential equations , 2003, Math. Comput..

[8]  H. Heinimann.  Swiss Federal Institute of Technology (ETH) , 2002 .

[9]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[10]  David Y. Y. Yun,et al.  On square-free decomposition algorithms , 1976, SYMSAC '76.

[11]  Joachim von zur Gathen,et al.  Computing Frobenius maps and factoring polynomials , 2005, computational complexity.

[12]  Štefan Schwarz,et al.  ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1956 .

[13]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[14]  Erich Kaltofen,et al.  A polynomial-time reduction from bivariate to univariate integral polynomial factorization , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[15]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[16]  Éric Schost,et al.  Complexity issues in bivariate polynomial factorization , 2004, ISSAC '04.

[17]  M. C. R. Butler.  ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1954 .

[18]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[19]  Arjen K. Lenstra.  Factoring Multivariate Polynomials over Finite Fields , 1985, J. Comput. Syst. Sci..

[20]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[21]  E. Berlekamp.  Factoring polynomials over finite fields , 1967 .

[22]  Erich Kaltofen,et al.  Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization , 1985, SIAM J. Comput..

[23]  Erich Kaltofen,et al.  Subquadratic-time factoring of polynomials over finite fields , 1995, STOC '95.

[24]  J. Gathen,et al.  Factorization of multivariate polynomials over finite fields , 1985 .

[25]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .