Before you leave...
Take 20% off your first order
20% off
Enter the code below at checkout to get 20% off your first order
Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P (Paperback) (ISBN-13: 9783540403449)
Vendor:
Martin Dietzfelbinger
Product type:
Books
- $54.99
$54.99- $54.99
- Unit price
- per
Subtotal:
$54.99
Description
xA 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.
Author: Martin Dietzfelbinger
ISBN-10: 3540403442
ISBN-13: 9783540403449
Publisher: Springer
Language: English
Published: 06/29/2004
Pages: 150
Format: Paperback
Weight: 0.55lbs
Size: 9.28h x 6.18w x 0.39d
By Martin Dietzfelbinger
xUniv.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago. In 1992, he obtained his Habilitation at the Universität Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the Universität Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische Universität Ilmenau, Germany. His main research interests are in complexity theory and data structures.
Recently Viewed Products
- Choosing a selection results in a full page refresh.