Martin Dietzfelbinger
Springer Berlin Heidelberg
2004e druk, 2004
9783540403449
Primality Testing in Polynomial Time
From Randomized Algorithms to "PRIMES Is in P"
Specificaties
Paperback, 150 blz.
|
Engels
Springer Berlin Heidelberg |
2004e druk, 2004
ISBN13: 9783540403449
Rubricering
Onderdeel van serie
Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540403449
Taal:Engels
Bindwijze:paperback
Aantal pagina's:150
Uitgever:Springer Berlin Heidelberg
Druk:2004
Inhoudsopgave
1. Introduction: Efficient Primality Testing.- 2. Algorithms for Numbers and Their Complexity.- 3. Fundamentals from Number Theory.- 4. Basics from Algebra: Groups, Rings, and Fields.- 5. The Miller-Rabin Test.- 6. The Solovay-Strassen Test.- 7. More Algebra: Polynomials and Fields.- 8. Deterministic Primality Testing in Polynomial Time.- A. Appendix.