Irreducibility Testing and Factorization of Polynomials
From MaRDI portal
Publication:3043254
DOI10.2307/2007706zbMath0527.12002OpenAlexW4238412968MaRDI QIDQ3043254
Leonard M. Adleman, Andrew M. Odlyzko
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/2007706
generalized Riemann hypothesisfactorization of polynomialsirreducibility of polynomialsalmost polynomial time irreducibility algorithmreduction to integer primality testing and factorization
Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Primality (11Y11)
Related Items
Univariate polynomial factorization over finite fields, Schinzel hypothesis on average and rational points, A heuristic irreducibility test for univariate polynomials, Prime values of polynomials and irreducibility testing, Polynomials with no Small Prime Values, Linear recurrence sequences without zeros