- We will send in 10–14 business days.
/images/books/13152677/9783540403449.jpg)
- Author: Martin Dietzfelbinger
- Publisher: Springer
- Pages: 147
- ISBN-10: 3540403442
- ISBN-13: 9783540403449
- Format: 15.7 x 23.6 x 1 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.17:04:38
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Martin Dietzfelbinger
- Publisher: Springer
- Pages: 147
- ISBN-10: 3540403442
- ISBN-13: 9783540403449
- Format: 15.7 x 23.6 x 1 cm, softcover
- Language: English 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.
Reviews