Factoring Multivariate Polynomials over Large Finite Fields

DOI10.2307/2008511zbMath0701.11069OpenAlexW4244572102MaRDI QIDQ3478494

Daqing Wan

Publication date: 1990

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

zbMATH Keywords

factorizationbivariate polynomialscomplete mappingsChowla-Zassenhaus conjectureexpected number of irreducible factorslarge finite fieldnew probabilistic algorithmrandom univariate polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40)

Related Items (3)

On Bivariate Polynomial Factorization over Finite Fields ⋮ Computational problems in the theory of finite fields ⋮ Hensel lifting and bivariate polynomial factorisation over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring multivariate polynomials over finite fields
• Factoring sparse multivariate polynomials
• Factoring polynomials with rational coefficients
• On Hensel factorization. I
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• Dickson Polynomials Over Finite Fields and Complete Mappings
• Factorization of Multivariate Polynomials Over Finite Fields
• Probabilistic Algorithms in Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: Factoring Multivariate Polynomials over Large Finite Fields