Irreducible polynomials with integral coefficients have succinct certificates

DOI10.1016/0196-6774(81)90036-5zbMath0489.68035OpenAlexW2006316966WikidataQ89046665 ScholiaQ89046665MaRDI QIDQ3951538

David G. Cantor

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90036-5

zbMATH Keywords

polynomial irreducibilitydense polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in number theory (11C08) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (4)

Factoring multivariate integral polynomials ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ Factoring polynomials with rational coefficients ⋮ An explicit solution to Post's problem over the reals

This page was built for publication: Irreducible polynomials with integral coefficients have succinct certificates