Overview
- Describes the new deterministic polynomial time primality test (Agrawal/Kayal/Saxena) with complete analysis in a consolidated way
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3000)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (9 chapters)
Keywords
About this book
Reviews
From the reviews:
"This book gives an account of the recent proof by M. Agrawal, N. Kayal and N. Saxena … that one can decide in polynomial time whether a given natural number is prime or composite. … It presents the background needed from number theory and algebra to make the proof accessible to undergraduates. … This concise book is written for students of computer science and of mathematics." (Samuel S. Wagstaff, Mathematical Reviews, Issue 2005 m)
"The book can logically be separated into two parts: the first covering introductory material and the second covering the AKS result itself. … Chapters … are a joy to read, and I found the proofs and explanations clear and concise. Amazingly, the material is presented in full, with complete proofs given for all results necessary for proving the main results of the book. … I would enthusiastically and wholeheartedly recommend this book … ." (Jonathan Katz, SIGACT News, Vol. 37 (1), 2006)
Authors and Affiliations
About the author
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.
Bibliographic Information
Book Title: Primality Testing in Polynomial Time
Book Subtitle: From Randomized Algorithms to "PRIMES Is in P"
Authors: Martin Dietzfelbinger
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b12334
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2004
Softcover ISBN: 978-3-540-40344-9Published: 29 June 2004
eBook ISBN: 978-3-540-25933-6Published: 17 August 2004
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 150
Topics: Number Theory, Algebra, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Cryptology, Probability and Statistics in Computer Science