Neeraj Kayal (Hindi: नीरज कयाल) is an Indian computer scientist and mathematician noted for development of the AKS primality test, along with Manindra Agrawal and Nitin Saxena. Kayal was born and raised in Guwahati, India.
>>>PUT SHARE BUTTONS HERE<<<
👉 Neeraj Kayal in the context of AKS primality test
The AKS primality test (also known as the Agrawal–Kayal–Saxena primality test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P". The algorithm was the first one which is able to determine in polynomial time, whether a given number is prime or composite without relying on mathematical conjectures such as the generalized Riemann hypothesis. The proof is also notable for not relying on the field of analysis. In 2006 the authors received both the Gödel Prize and Fulkerson Prize for their work.
In this Dossier
Neeraj Kayal in the context of Nitin Saxena
Nitin Saxena (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.
He attracted international attention for proposing the AKS Primality Test in 2002 in a joint work with Manindra Agrawal and Neeraj Kayal, for which the trio won the 2006 Fulkerson Prize, and the 2006 Gödel Prize. They provided the first unconditional deterministic algorithm to test an n-digit number for primality in a time that has been proven to be polynomial in n. This research work came out as a part of his undergraduate study.