from 2 Hours* Last Christmas
delivery dates Free UK Standard Delivery On all orders over £25 Order in time for Christmas 16th December by 3pm 2nd Class |
19th December by 3pm 1st Class Free Click & Collect to shops From 2 hours after you order*
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" - Lecture Notes in Computer Science 3000 (Paperback)Martin Dietzfelbinger (author)
- We can order this from the publisher
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.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Number of pages: 150
Weight: 530 g
Dimensions: 233 x 155 x 8 mm
Edition: 2004 ed.
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)
You may also be interested in...
Would you like to proceed to the App store to download the Waterstones App?