Researchers Devise Fast Deterministic Algorithm for Primality Testing

Sara Robinson

One Sunday last month, Manindra Agrawal, a professor of computer science at the Indian Institute of Technology in Kanpur, quietly sent a postscript file to a dozen or so experts in theoretical computer science and computational number theory. He was relieved that three years of hard work---two off and on by himself and one more with his PhD students Neeraj Kayal and Nitin Saxena---had panned out.

• Download this PDF [38K]
• See more news from this issue

Donate · Contact Us · Site Map · Join SIAM · My Account