PirateLib
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P" 封面

Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"

A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers 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 volume is written for students of computer science, in particular 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.
标签
Mathematics
类别
Mathematics
ISBN
ISBN 10: 3540259333
ISBN 13: 9783540259336
English
发布日期
8/17/2004
出版商
Springer
作者
Martin Dietzfelbinger
Rating
暂无评分
公开 "Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"" 讨论
发表新评论
我们找到了 0 条满足该查询的评论
PirateLib Logo