Deterministic irreducibility testing of polynomials over large finite fields

Authors:
Erich Kaltofen
Affiliations:
Rensselaer Polytechnic Institute, Department of Computer Science, Troy, New York 12181 and Mathematical Sciences Research Institute, 1000 Centennial Drive, Berkeley, California 94720, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 3
Cited 4

Fast parallel absolute irreducibility testing

Journal of Symbolic Computation
Finding irreducible polynomials over finite fields

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Riemann hypothesis and finding roots over finite fields

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

Computing the irreducible real factors and components of an algebraicf curve

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The computational complexity of recognizing permutation functions

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved dense multivariate polynomial factorization algorithms

Journal of Symbolic Computation
Deterministic distinct-degree factorization of polynomials over finite fields

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sequential deterministic polynomial-time algorithm for testing dense multivariate polynomials over a large finite field for irreducibility. All previously known algorithms were of a probabilistic nature. Our deterministic solution is based on our algorithm for absolute irreducibility testing combined with Berlekamp's algorithm.