Deterministic distinct-degree factorization of polynomials over finite fields

DOI10.1016/J.JSC.2004.05.004MaRDI QIDQ2643572zbMATH OpenOpenAlexFDO

Authors 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

deterministic algorithmmultivariate polynomialdistinct-degree factorization

Mathematics Subject Classification ID

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

Recommendations

• On a New Factorization Algorithm for Polynomials Over Finite Fields
• On Bivariate Polynomial Factorization over Finite Fields
• Factoring polynomials over arbitrary finite fields
• scientific article; zbMATH DE number 1273636
• On the deterministic complexity of factoring polynomials over finite fields

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3785035 (Why is no real title available?)
• scientific article; zbMATH DE number 2151236 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• Complexity issues in bivariate polynomial factorization
• Computing Frobenius maps and factoring polynomials
• Deterministic irreducibility testing of polynomials over large finite fields
• Factoring multivariate polynomials via partial differential equations
• Factorization of Multivariate Polynomials Over Finite Fields
• Fast parallel absolute irreducibility testing
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Modern computer algebra
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
• On Euclid's Algorithm and the Theory of Subresultants
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Subquadratic-time factoring of polynomials over finite fields

Cited in

(6)

• On some computations on sparse polynomials
• Improved dense multivariate polynomial factorization algorithms
• scientific article; zbMATH DE number 1273636 (Why is no real title available?)
• Lifting and recombination techniques for absolute factorization
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Using zeta functions to factor polynomials over finite fields

This page was built for publication: Deterministic distinct-degree factorization of polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643572)