Edition: 2004
Release: 2004-08-17
Publisher: Springer
Binding: Paperback
ISBN/ASIN: 3540403442
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. Free download Primality Testing in Polynomial Time books collection in PDF, EPUB, FB2, MOBI, and TXT formats. 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. Best deals ebooks download Primality Testing in Polynomial Time on amazon.The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study. Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science) with free ebook downloads available via rapidshare, mediafire, 4shared, and hotfile.
Download Primality Testing in Polynomial Time
