Deterministic distinct-degree factorization of polynomials over finite fields

DOI10.1016/j.jsc.2004.05.004zbMath1130.11336OpenAlexW2155839837MaRDI QIDQ2643572

Shuhong Gao, Alan G. B. Lauder, Erich L. Kaltofen

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.05.004

zbMATH Keywords

multivariate polynomialdeterministic algorithmdistinct-degree factorization

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items

Lifting and recombination techniques for absolute factorization, Unnamed Item, Improved dense multivariate polynomial factorization algorithms

Cites Work

• Fast parallel absolute irreducibility testing
• Deterministic irreducibility testing of polynomials over large finite fields
• Computing Frobenius maps and factoring polynomials
• Hensel lifting and bivariate polynomial factorisation over finite fields
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
• Factorization of Multivariate Polynomials Over Finite Fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Subquadratic-time factoring of polynomials over finite fields
• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• On Euclid's Algorithm and the Theory of Subresultants
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item