Contact
How to shop
Delivery
Shopping guide
Primality Testing in Polynomial Time
From Randomized Algorithms to "Primes is in P"
English
125 b
Up to 30 days for returns
Customers also purchased
/
Paperback
12.13
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
50.56
€
/
Paperback
9.70
€
/
Paperback
12.63
€
/
Paperback
45.80
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?