Abstract

In August 2002, three Indian researchers, Manindra Agrawal and his students Neeraj Kayal and Nitin Saxena at the Indian Institute of Technology in Kanpur, presented a remarkable algorithm (the AKS algorithm) in their paper "PRIMES is in P." It is a deterministic polynomial-time algorithm that determines whether an input number is prime or composite. No such algorithm was known so far and it has fundamental meaning for complexity theory. This project is centered around the AKS algorithm from the "PRIMES is in P" paper. The objectives are both experiments with the AKS algorithm and theorems and lemmas showing the correctness of the algorithm. One of the tasks of the project is to provide easy-to-follow explanations of the original paper for average mathematically mature readers. We also analyze the AKS algorithm in detail. Ideas and concepts in the algorithm are studied and possibilities of improvements of the algorithm are explored.

Publication Date

2006

Document Type

Master's Project

Student Type

Graduate

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Radziszowski, Stainslaw - Chair

Advisor/Committee Member

Hemaspaandra, Edith

Advisor/Committee Member

Anderson, Peter

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2013.

Additional Files
TAoyamaProposal2002.pdf (175 kB)

Campus

RIT – Main Campus

Download

Additional files available below

Share

COinS