PRIMES is in P

@inproceedings{Agrawal2002PRIMESII,
  title={PRIMES is in P},
  author={Manindra Agrawal and Neeraj Kayal and Nitin Saxena},
  year={2002}
}
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
Highly Influential
This paper has highly influenced 37 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 537 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 350 extracted citations

538 Citations

02040'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 538 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Technical report

  • Neeraj Kayal, Nitin Saxena. Towards a deterministic polynomial-time test
  • IIT Kanpur,
  • 2002

The Brun-Titchmarsh Theorem on average

  • R. C. Baker, G. Harman
  • Proceedings of a conference in Honor of Heini…
  • 1996
1 Excerpt

Primality testing and two dimensional Abelian varieties over finite fields

  • L. M. Adleman, M.-D. Huang
  • Lecture Notes in Mathematics, 1512
  • 1992
1 Excerpt

boulder (colorado)

  • A.O.L. Atkin. Lecture notes of a conference
  • Manuscript, August
  • 1986
1 Excerpt

Theoreme de Brun-Titchmarsh; application au theoreme de Fermat

  • E. Fouvry
  • Invent. Math., 79:383–407
  • 1985

Probabilistic algorithm for testing primality

  • M. O. Rabin
  • J. Number Theory, 12:128–138
  • 1980
1 Excerpt

Similar Papers

Loading similar papers…