Prime values of polynomials and irreducibility testing

DOI10.1090/S0273-0979-1984-15247-9zbMath0543.10033MaRDI QIDQ3331290

Kevin S. McCurley

Publication date: 1984

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

irreducibilitycomposite

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Primes in congruence classes (11N13) Polynomials (irreducibility, etc.) (11R09)

Related Items

Polynomials with no Small Prime Values, On the Sprindžuk-Weissauer approach to universal Hilbert subsets, A divisor problem for polynomials

Cites Work

• Unnamed Item
• On distinguishing prime numbers from composite numbers
• A note on the least prime in an arithmetic progression
• Factoring polynomials with rational coefficients
• Irreducibility Testing and Factorization of Polynomials
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• Note on Irreducibility Testing