Factorization of Multivariate Polynomials Over Finite Fields

DOI10.2307/2008063zbMath0596.12017OpenAlexW4249593543MaRDI QIDQ3728101

Erich L. Kaltofen, Joachim von zur Gathen

Publication date: 1985

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

zbMATH Keywords

finite fieldpolynomial factorizationmultivariate polynomialsprobabilistic algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06)

Related Items (22)

Factoring sparse multivariate polynomials ⋮ Irreducibility of multivariate polynomials ⋮ Factoring multivariate polynomials via partial differential equations ⋮ Factoring polynomials and primitive elements for special primes ⋮ Deterministic distinct-degree factorization of polynomials over finite fields ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Values of polynomials over finite fields ⋮ On Bivariate Polynomial Factorization over Finite Fields ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Factoring polynomials over function fields ⋮ Counting curves and their projections ⋮ Complexity of solving parametric polynomial systems ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ An empirical study of cache-oblivious polygon indecomposability testing ⋮ Theory of computational complexity. Part 9. Transl. from the Russian. ⋮ The computational complexity of recognizing permutation functions ⋮ Factoring Multivariate Polynomials over Large Finite Fields ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Parallel methods for absolute irreducibility testing ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Deterministic irreducibility testing of polynomials over large finite fields ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.

This page was built for publication: Factorization of Multivariate Polynomials Over Finite Fields