Deterministic irreducibility testing of polynomials over large finite fields

DOI10.1016/S0747-7171(87)80055-XzbMath0683.68037MaRDI QIDQ1825030

Erich L. Kaltofen

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

irreducibility testing of polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items

Deterministic distinct-degree factorization of polynomials over finite fields, Improved dense multivariate polynomial factorization algorithms, Computational problems in the theory of finite fields, Factoring polynomials over finite fields: A survey, Absolute irreducibility of polynomials via Newton polytopes, The computational complexity of recognizing permutation functions, Computing the irreducible real factors and components of an algebraic curve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring multivariate polynomials over finite fields
• Fast parallel absolute irreducibility testing
• Factoring polynomials and primitive elements for special primes
• On Hensel factorization. I
• Effective procedures in field theory
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factorization of Multivariate Polynomials Over Finite Fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• A New Algorithm for Factoring Polynomials Over Finite Fields
• On the Efficiency of Algorithms for Polynomial Factoring
• Factoring Polynomials Over Large Finite Fields
• ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD