Neeraj Kayal (Hindi: नीरज कयाल) is an Indian computer scientist.

Kayal was born and brought up in Guwahati, India. He was awarded the National Talent Search Scholarship, as well as the Jagadis Bose National Science Talent Search (Junior) Scholarship, both in 1996. He was also selected for Indian National Mathematics Olympiad in 1997.

Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur (IITK), India in 2002. In that year, he, Manindra Agrawal and Nitin Saxena proposed the AKS Primality Test[1], which attracted worldwide attention, including an article in the New York Times[2]. This research remarkably came out as a part of undergraduate study.

He was given the Distinguished Alumnus Award of the IITK, for his work in computational complexity theory. He has been awarded the prestigious Gödel prize for the same along with his co-authors. Kayal was also a two time awardee of the Dr.Subratananda Dowerah Gold Medal awarded annually by the Assam Academy of Mathematics.

Kayal received his PhD in theoretical computer science from the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur. He did a post-doctoral from Rutgers University. He is currently working as a Researcher with the Microsoft Research India.

Selected publications

* Kayal, Neeraj (2005), Recognizing permutation functions in polynomial time, ECCC TR05-008 .
* Kayal, Neeraj; Saxena, Nitin (2005), Polynomial Identity Testing for Depth 3 Circuits, ECCC TR05-150 .

References

1. ^ Bornemann, F. Primes is in P: A Breakthrough for "Everyman". Notices of the AMS, May 2003.
2. ^ Robinson, S. New Method Said to Solve Key Problem in Math. New York Times, August 8, 2002.

External links

* Neeraj Kayal's Homepage.
* Distinguished Alumnus Award Profile: Neeraj Kayal at the IIT Kanpur Alumni Association.