Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P (Lecture Notes in Computer Science #3000) (Paperback)

Before placing an order, please note:

  • You'll receive a confirmation email once your order is complete and ready for pickup. 
  • If you have a membership, please make a note of this in the order comments and we'll apply your discount.
  • Online orders are nonrefundable and cannot be exchanged.
  • If you place a pre-order to be shipped in the same order as currently available titles, an additional shipping fee will be added to your order.  
  • Women & Children First is not responsible for lost or stolen packages.
Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P (Lecture Notes in Computer Science #3000) By Martin Dietzfelbinger Cover Image
$65.99
Unavailable

Description


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.

Product Details
ISBN: 9783540403449
ISBN-10: 3540403442
Publisher: Springer
Publication Date: June 29th, 2004
Pages: 150
Language: English
Series: Lecture Notes in Computer Science