Irreducibility Testing and Factorization of Polynomials

DOI10.2307/2007706MaRDI QIDQ3043254zbMATH OpenOpenAlexFDO

Authors Leonard M. Adleman, Andrew Odlyzko

Publication date 1983

Full work available at URL https://doi.org/10.2307/2007706

zbMATH Keywords

almost polynomial time irreducibility algorithmfactorization of polynomialsgeneralized Riemann hypothesisirreducibility of polynomialsreduction to integer primality testing and factorization

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16)

Cited in

(10)

• Univariate polynomial factorization over finite fields
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• A heuristic irreducibility test for univariate polynomials
• Finding irreducible and primitive polynomials
• Equivalence of polynomial identity testing and polynomial factorization
• Schinzel hypothesis on average and rational points
• Prime values of polynomials and irreducibility testing
• Polynomials with no Small Prime Values
• Linear recurrence sequences without zeros
• Polynomial irreducibility via shifts

This page was built for publication: Irreducibility Testing and Factorization of Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043254)