Primality testing in polynomial time: from randomized algorithms to 'primes is in p'
Auteur :
Dietzfelbinger, Martin
Éditeur :
Dietzfelbinger, Martin
ISBN :
9783540403449
Date de publication :
15 nov. 2003
Dimensions :
23,3 x 15,5 x 0,8 cm
Poids :
530 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Allemagne
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.