Skip to main content alibris logo

Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P

by

Write The First Customer Review
Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P - Dietzfelbinger, Martin
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem, covering 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 special interest in cryptology, and students of mathematics. The text may be used as a supplement for courses or for self-study.

loading
Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P 2004, Springer, Berlin, Heidelberg

ISBN-13: 9783540403449

2004 edition

Trade paperback