Buy and Download - Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P Lecture Notes in Computer Science by Martin Dietzfelbinger PDF eBook

Home

All soft

Last soft

Your Orders

Customers opinion

Helpdesk

Cart

Program Search:

Shopping Cart:

*Note: Minimum order price: €20

We Recommend:

Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P Lecture Notes in Computer Science by Martin Dietzfelbinger PDF eBook €1 buy download

English
2008
ISBN: 3540403442, 9783540403449
150 Pages
PDF

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 special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.

Download File Size:970.94 KB

Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P Lecture Notes in Computer Science by Martin Dietzfelbinger PDF eBook