A heuristic irreducibility test for univariate polynomials
From MaRDI portal
Publication:1186702
DOI10.1016/0747-7171(92)90005-OzbMATH Open0748.12010OpenAlexW2092099512MaRDI QIDQ1186702FDOQ1186702
Authors: Michael 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
Recommendations
- A family of tests for irreducibility of polynomials
- An irreducibility test for polynomials whose coefficients are algebraic integers
- Irreducibility Testing and Factorization of Polynomials
- Irreducibility testing of lacunary 0,1-polynomials
- Probabilistic absolute irreducibility test for polynomials
- An irreducibility criterion for polynomials in several variables
- Deterministic irreducibility testing of polynomials over large finite fields
- An irreducibility criterion for polynomials over integers
- Pseudoirreducible polynomials: probabilistic irreducibility testing
- scientific article; zbMATH DE number 3038327
Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Factorization (11Y05) Primality (11Y11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- A Fast Monte-Carlo Test for Primality
- Factoring Polynomials Over Large Finite Fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Inequality About Factors of Polynomials
- Title not available (Why is that?)
- 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
- Irreducibility Testing and Factorization of Polynomials
- On the Efficiency of a Polynomial Irreducibility Test
- An Irreducibility Criterion for Polynomials Over the Integers
Cited In (8)
- Certifying irreducibility in \(\mathbb{Z}[x]\)
- On testing a bivariate polynomial for analytic reducibility
- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- Irreducibility of a polynomial over the field of \(p\) elements with \(p\) prime.
- [[Publication:4848389|A Simple Algorithm for Deciding Primes in K[[x,y]]]]
- Isomorphisms of algebraic number fields
- Modular Las Vegas algorithms for polynomial absolute factorization
- Probabilistic absolute irreducibility test for polynomials
Uses Software
This page was built for publication: A heuristic irreducibility test for univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186702)
