On Bivariate Polynomial Factorization over Finite Fields

DOI10.2307/2153117zbMath0777.11055OpenAlexW4250880453MaRDI QIDQ5288235

Igor E. Shparlinski

Publication date: 15 August 1993

Full work available at URL: https://doi.org/10.2307/2153117

zbMATH Keywords

finite fieldsdeterministic algorithmfactoring of bivariate polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40)

Related Items

Factoring polynomials over finite fields: A survey ⋮ The computational complexity of recognizing permutation functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials using fewer random bits
• Factoring multivariate polynomials over finite fields
• Smoothness and factoring polynomials over finite fields
• Factoring Multivariate Polynomials over Large Finite Fields
• Factorization of Multivariate Polynomials Over Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Polynomials Over Large Finite Fields