Primality Testing in Polynomial Time From Randomized Algorithms to "PRIMES Is in P" /
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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2004.
|
| Series: | Lecture Notes in Computer Science,
3000 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
