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

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

5.0 of 5 stars 5.00  ·  rating details  ·  1 rating  ·  0 reviews
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)
more details... edit details

Friend Reviews

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

Community Reviews

(showing 1-4 of 4)
filter  |  sort: default (?)  |  rating details
Veress Odon
Veress Odon marked it as to-read
Jan 27, 2014
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 »
Taschenbuch Der Algorithmen Algorithms Unplugged Algorithmen Und Datenstrukturen: Die Grundwerkzeuge

Share This Book