An Exposition of the Deterministic Polynomial-time Primality Testing Algorithm of Agrawal-Kayal-Saxena
| Author | : Robert Lawrence Anderson |
| Publisher | : |
| Total Pages | : 80 |
| Release | : 2005 |
| ISBN-10 | : OCLC:63014052 |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis An Exposition of the Deterministic Polynomial-time Primality Testing Algorithm of Agrawal-Kayal-Saxena by : Robert Lawrence Anderson
Download or read book An Exposition of the Deterministic Polynomial-time Primality Testing Algorithm of Agrawal-Kayal-Saxena written by Robert Lawrence Anderson and published by . This book was released on 2005 with total page 80 pages. Available in PDF, EPUB and Kindle. Book excerpt: I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.
