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)
Enlarge cover
Rate this book
Clear rating
Open Preview

Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science)

it was amazing 5.00  ·  Rating Details  ·  1 Rating  ·  0 Reviews
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)
More Details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Primality Testing In Polynomial Time, please sign up.

Be the first to ask a question about Primality Testing In Polynomial Time

Community Reviews

(showing 1-7 of 7)
filter  |  sort: default (?)  |  Rating Details
JoS
JoS marked it as to-read
Jul 28, 2016
Shailendra Kumar
Shailendra Kumar marked it as to-read
Feb 26, 2015
Veress Odon
Veress Odon marked it as to-read
Jan 27, 2014
Tyler Cadigan
Tyler Cadigan rated it it was amazing
Dec 01, 2013
David
David marked it as to-read
Oct 14, 2013
Jay
Jay marked it as to-read
Apr 25, 2012
There are no discussion topics on this book yet. Be the first to start one »

Share This Book