6th out of 10 books — 3 voters
Goodreads helps you keep track of books you want to read.
Start by marking “Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science)” as Want to Read:
Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In 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 . Finding out whether a given number n is a prime or not is a problem that was formul ...more
Paperback, 147 pages
Published June 29th 2004 by Springer
(first published November 1st 2003)
To see what your friends thought of this book, please sign up.
(showing 1-7 of 7)