PRIMES is in P

@inproceedings{Agrawal2004PRIMESII,
  title={PRIMES is in P},
  author={Manindra Agrawal and Neeraj Kayal and Nitin Saxena},
  year={2004}
}
We present a deterministic polynomial-time algorithm that determines whether an input number n is prime or composite. “The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers to such an extent that it would be superfluous to discuss the problem at length... Further, the dignity of the science… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 412 CITATIONS, ESTIMATED 22% COVERAGE

FILTER CITATIONS BY YEAR

1981
2019

CITATION STATISTICS

  • 38 Highly Influenced Citations

  • Averaged 26 Citations per year over the last 3 years

Similar Papers

Loading similar papers…