Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Primality Testing in Polynomial Time
From Randomized Algorithms to "Primes is in P"
Angličtina
125 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
11.50
€
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.
Informácie o knihe
Angličtina
Kategórie
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
50.47
€
/
Brožovaná
9.18
€
/
Brožovaná
43.51
€
/
Brožovaná
11.80
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?