Nitin Saxena
Indian mathematician and computer scientist / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Nitin Saxena?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Nitin Saxena (born 3 May 1981[1]) is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.
Quick Facts Born, Nationality ...
Nitin Saxena | |
---|---|
Born | (1981-05-03) 3 May 1981 (age 43) |
Nationality | Indian |
Alma mater | IIT Kanpur |
Awards | Gödel Prize (2006) Fulkerson Prize (2006) Shanti Swarup Bhatnagar Prize (2018) |
Scientific career | |
Fields | Mathematics Theoretical computer science |
Institutions | CWI Amsterdam University of Bonn IIT Kanpur |
Thesis | Morphisms of Rings and Applications to Complexity (2006) |
Doctoral advisor | Manindra Agrawal |
Close
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.[2] This research work came out as a part of his undergraduate study.