Nitin Saxena | |
|---|---|
 Nitin Saxena receiving Shanti Swarup Bhatnagar Prize from Narendra Modi | |
| Born | 3 May 1981 |
| 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 |
Nitin Saxena (born 3 May 1981[1]) 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.[2] This research work came out as a part of his undergraduate study.
YouTube Encyclopedic
-
1/3Views:7952 968365
-
Algebraic vs Functional independence over any characteristic by Nitin Saxena
-
Prof. Nitin Saxena CSE @IIT Kanpur
-
Algebraic Dependence is Not Hard (& Filling the GCT Chasm)
Transcription
Early life and education
He is an alumnus of Boys' High School And College, Allahabad. He graduated with his B.Tech in Computer Science and Engineering from Indian Institute of Technology Kanpur in 2002. He received his PhD from the Department of Computer Science and Engineering of the same institute in 2006 with the Dissertation titled "Morphisms of Rings and Applications to Complexity".[3]
Career
He was awarded the Distinguished Alumnus Award of the Indian Institute of Technology Kanpur in 2003 for his work in computational complexity theory. He was appointed at the Centrum Wiskunde & Informatica (CWI) starting as a postdoc researcher from September 2006 onwards.[4] He was a Bonn Junior Fellow at the University of Bonn from Summer 2008 onwards.[1] He joined the Department of Computer Science and Engineering at IIT Kanpur as faculty in April 2013.[5][better source needed]
Saxena was awarded the 2018 Shanti Swarup Bhatnagar Prize for his work in Algebraic Complexity Theory. One of the youngest awardees, Saxena’s research interests include Computational Complexity and Algebraic Geometry.[6]
References
- ^ a b Saxena's CV at University of Bonn Archived 24 August 2009 at the Wayback Machine
- ^ Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin (2004). "Primes is in P" (PDF). Annals of Mathematics. 160 (2): 781–793. doi:10.4007/annals.2004.160.781.
- ^ Saxena's PhD thesis Archived 16 July 2011 at the Wayback Machine
- ^ [1][permanent dead link]
- ^ "Department of Computer Science and Engineering, IIT Kanpur". Retrieved 6 April 2013.
- ^ "Prof Nitin Saxena from IIT Kanpur awarded the Shanti Swarup Bhatnagar Prize 2018 for his work on algebraic circuits". 15 November 2018.
External links
- Nitin Saxena's Homepage
- Profile of Nitin Saxena at the IIT Kanpur Alumni Association
- Kayal, Neeraj; Saxena, Nitin (2005), Polynomial Identity Testing for Depth 3 Circuits, ECCC TR05-150.
- Nitin Saxena at the Mathematics Genealogy Project
- Nitin Saxena publications indexed by Google Scholar
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
This page was last edited on 26 December 2023, at 11:04