Primality Testing in Polynomial Time
Polynomials
Data encryption (Computer science)
Number theory
Algorithms
Computer software
Computer science
On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Find…
Read online
Reader not loading? Open it on Archive.org instead.
