Computational aspects of irreducible polynomials

DOI10.1134/S0965542520010133zbMath1454.12001OpenAlexW3013453932MaRDI QIDQ2206416

Doru Ştefănescu

Publication date: 22 October 2020

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542520010133

zbMATH Keywords

irreducible polynomialscomputer polynomial algebrapolynomial divisors

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Computational methods for problems pertaining to field theory (12-08)

Cites Work

• Unnamed Item
• Unnamed Item
• On the generalized difference polynomials
• Products of polynomials in many variables
• An inequality on the greatest roots of a polynomial
• Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
• On the smallest divisor of a polynomial
• IRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS
• Some Extensions and Applications of the Eisenstein Irreducibility Criterion
• Difference polynomials and their generalizations
• A mild generalization of Eisenstein’s criterion
• Schönemann–Eisenstein–Dumas-Type Irreducibility Conditions that Use Arbitrarily Many Prime Numbers

This page was built for publication: Computational aspects of irreducible polynomials