Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
An Exposition Of The Deterministic Polynomial-Time Primality Testing Algorithm Of Agrawal-Kayal-Saxena, Robert Lawrence Anderson
An Exposition Of The Deterministic Polynomial-Time Primality Testing Algorithm Of Agrawal-Kayal-Saxena, Robert Lawrence Anderson
Theses and Dissertations
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.