Classification and irreducibility of a class of integer polynomials
From MaRDI portal
Cites work
- A new class of irreducible polynomials
- An Irreducibility Criterion for Polynomials Over the Integers
- Criteria for the irreducibility of polynomials
- Mathematica®: A Problem-Centered Approach
- On two conjectures of irreducible polynomials
- Prime Numbers and Irreducible Polynomials
- Some factorization results for bivariate polynomials
- Some factorization results on polynomials having integer coefficients
This page was built for publication: Classification and irreducibility of a class of integer polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903618)