5th out of 9 books — 2 voters
Primality Testing In Polynomial Time: From Randomized Algorithms To "Primes Is In P" (Lecture Notes In Computer Science)
A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal and Saxena. The volume is written for students of computer science, in particular those with a...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.