Item description for Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science) by Martin Dietzfelbinger...
This book is devoted toalgorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite.
The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number ofdigits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology.
This book gives a self-contained account 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 textbook is written for students of computer science, in particular forthose with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.1" Width: 6.1" Height: 0.2" Weight: 0.55 lbs.
Release Date Aug 17, 2004
ISBN 3540403442 ISBN13 9783540403449
Availability 57 units. Availability accurate as of May 24, 2017 02:20.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Martin Dietzfelbinger
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 UniversitAt Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the UniversitAt Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische UniversitAt Ilmenau, Germany. His main research interests are in complexity theory and data structures.