Vertel uw vrienden over dit artikel:
Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science Martin Dietzfelbinger
Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science
Martin Dietzfelbinger
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 | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 29 juni 2004 |
| Datum oorspronkelijke uitgave | 2003 |
| ISBN13 | 9783540403449 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 160 |
| Afmetingen | 155 × 233 × 8 mm · 249 g |
| Taal en grammatica | Duits |
Meer door Martin Dietzfelbinger
Alles tonenMeer van dezelfde uitgever
Bekijk alles van Martin Dietzfelbinger ( bijv. Paperback Book )