A heuristic irreducibility test for univariate polynomials

DOI10.1016/0747-7171(92)90005-OzbMath0748.12010OpenAlexW2092099512MaRDI QIDQ1186702

Michael B. Monagan

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0747-7171(92)90005-o

zbMATH Keywords

factorizationirreducibilityunivariate polynomialsBerlekamp-Hensel procedure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Factorization (11Y05) Primality (11Y11)

Related Items (3)

Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ Isomorphisms of algebraic number fields

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Factoring polynomials with rational coefficients
• Riemann's hypothesis and tests for primality
• Irreducibility Testing and Factorization of Polynomials
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• A Generalized Class of Polynomials that are Hard to Factor
• A New Algorithm for Factoring Polynomials Over Finite Fields
• An Inequality About Factors of Polynomials
• A Fast Monte-Carlo Test for Primality
• On the Efficiency of a Polynomial Irreducibility Test
• An Irreducibility Criterion for Polynomials Over the Integers
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: A heuristic irreducibility test for univariate polynomials