Contact
Hoe winkelen bij ons werkt
Bezorging
Winkelgids
Primality Testing in Polynomial Time
From Randomized Algorithms to "Primes is in P"
Engels
125 b
Tot 30 dagen retourrecht
Klanten kochten ook
/
Paperback
12.34
€
This book is devoted to algorithms 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 of digitsneeded 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 for 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.
Informatie over het boek
Engels
Categorieën
Geef dit boek vandaag nog cadeau
Dat gaat heel eenvoudig
1 Voeg het boek toe aan je winkelwagentje en selecteer Als cadeau bezorgen 2 Je krijgt van ons per omgaand een voucher 3 Het boek wordt bezorgd op het adres van de ontvangerDit vind je misschien ook interessant
/
Paperback
50.11
€
/
Paperback
8.73
€
/
Paperback
12.85
€
/
Paperback
45.89
€
Hoi! Ik ben Libroamiko, je boekadviseur.
Hoe kan ik je helpen?