Proceedings of the American Mathematical Society · 1996 · 54 citations · 13 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsNumber TheoryAlgebraic Number TheoryCombinatorial Number TheoryComputational Number TheoryNumber-theoretic AlgorithmsRoot FindingPolynomial Root Finding
Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every non-zero integer.
13
Elementary and Analytic Theory of Algebraic Numbers
Peter Shiu, Władysław Narkiewicz · The Mathematical Gazette · 1991 · 769 citations
Explicit bounds for primality testing and related problems
Eric Bach · Mathematics of Computation · 1990 · 212 citations · Full text