A heuristic irreducibility test for univariate polynomials
From MaRDI portal
(Redirected from Publication:1186702)
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
Cites work
- scientific article; zbMATH DE number 3870586 (Why is no real title available?)
- scientific article; zbMATH DE number 3909733 (Why is no real title available?)
- scientific article; zbMATH DE number 3936514 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- 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
- An Irreducibility Criterion for Polynomials Over the Integers
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials with rational coefficients
- Irreducibility Testing and Factorization of Polynomials
- On the Efficiency of a Polynomial Irreducibility Test
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
Cited in
(8)- On testing a bivariate polynomial for analytic reducibility
- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- Certifying irreducibility in \(\mathbb{Z}[x]\)
- Irreducibility of a polynomial over the field of \(p\) elements with \(p\) prime.
- Isomorphisms of algebraic number fields
- [[:Publication:4848389|A Simple Algorithm for Deciding Primes in K[[x,y]]]]
- Modular Las Vegas algorithms for polynomial absolute factorization
- Probabilistic absolute irreducibility test for polynomials
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)
