• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P

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

Paperback

Series: Lecture Notes in Computer Science, Book 3000

General ComputersGeneral MathematicsComputer Security

ISBN10: 3540403442
ISBN13: 9783540403449
Publisher: Springer Nature
Published: Jun 29 2004
Pages: 150
Weight: 0.55
Height: 0.39 Width: 6.18 Depth: 9.28
Language: English

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.

Also in

Computer Security