Primality Testing for Beginners
Изчерпано количество
Продуктът не е наличен
Запиши се за известие при зареждане
In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. Rempe-Gillen and Waldecker introduce the aspects of number theory, algorithm theory, and cryptography that are relevant for the AKS algorithm and explain in detail why and how this test works.
Информация за "Primality Testing for Beginners"
- SKU 9780821898833
- Weight 0.300000
- ISBN 9780821898833
- Вид корица Paperback / softback
- Издателство American Mathematical Society
- Брой страници 248
The information below is required for social login