Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science - Martin Dietzfelbinger - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540403449 - June 29, 2004
In case cover and title do not match, the title is correct

Martin Dietzfelbinger
Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science

Price
HK$ 437
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 5 - 11

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Written for students of computer science, this volume gives a 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 deterministic algorithm of Agrawal, Kayal, and Saxena.

160 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released June 29, 2004
Original release date 2003
ISBN13 9783540403449
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 160
Dimensions 155 × 233 × 8 mm   ·   249 g
Language German  

More by Martin Dietzfelbinger

Show all

Mere med samme udgiver

See all of Martin Dietzfelbinger ( e.g. Paperback Book )