Martin Dietzfelbinger

Primality Testing in Polynomial Time

From Randomized Algorithms to "PRIMES Is in P"

Ebook (PDF Format)

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.

CHF 59.00

Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)

Versandfertig innerhalb 1-3 Werktagen
Versandkostenfrei

Produktdetails

ISBN: 978-3-540-25933-6
EAN: 9783540259336
Produktnummer: 37161444
Verlag: Springer Berlin Heidelberg
Sprache: Englisch
Erscheinungsjahr: 2004
Seitenangabe: 150 S.
Plattform: PDF
Auflage: 2004
Reihenbandnummer: 3000

Über den Autor

Univ.-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.