Deterministic distinct-degree factorization of polynomials over finite fields

DOI10.1016/J.JSC.2004.05.004zbMATH Open1130.11336OpenAlexW2155839837MaRDI QIDQ2643572FDOQ2643572

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

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

zbMATH Keywords

deterministic algorithmmultivariate polynomialdistinct-degree factorization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Title not available (Why is that?)
• On some computations on sparse polynomials
• Using zeta functions to factor polynomials over finite fields
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms

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)