imported>OAbot: Open access bot: doi added to citation with #oabot.

2021-05-05T23:57:57Z

Open access bot: doi added to citation with #oabot.

New page

{{short description|Indian mathematician and computer scientist}}
{{BLP sources|date=January 2020}}
{{Use Indian English|date=December 2015}}
{{Use dmy dates|date=December 2015}}
{{Infobox scientist
| name = Nitin Saxena
| image = The Prime Minister, Shri Narendra Modi presenting the Shanti Swarup Bhatnagar Prizes for Mathematical Sciences to Dr. Nitin Saxena, Professor, IIT Kanpur, at a function in New Delhi on February 28, 2019.jpg
| image_size =
| caption = Nitin Saxena receiving [[Shanti Swarup Bhatnagar Prize]]
| birth_date = {{Birth date and age|1981|05|03|df=y}}
| birth_place = [[Allahabad]], [[India]]
| death_date =
| death_place =
| nationality = [[India]]n
| fields = [[Mathematics]] [[Theoretical computer science]]
| workplaces = [[Centrum Wiskunde & Informatica|CWI Amsterdam]] [[University of Bonn]] [[IIT Kanpur]]
| alma_mater = [[IIT Kanpur]]
| doctoral_advisor = [[Manindra Agrawal]]
| thesis_title = Morphisms of Rings and Applications to Complexity
| thesis_url = 
| thesis_year = 2006
| doctoral_students =
| known_for =
| awards = [[Gödel Prize]] {{small|(2006)}} [[Fulkerson Prize]] {{small|(2006)}} [[Shanti Swarup Bhatnagar Prize]] {{small|(2018)}}
}}

'''Nitin Saxena''' (born 3 May 1981<ref name=bonn>[http://www.math.uni-bonn.de/~saxena/about-dir/resume.pdf Saxena's CV at University of Bonn] {{webarchive|url=https://web.archive.org/web/20090824011359/http://www.math.uni-bonn.de/~saxena/about-dir/resume.pdf |date=24 August 2009 }}</ref>) is an [[Science and technology in the Republic of India|Indian scientist]] in [[mathematics]] and [[theoretical computer science]]. His research focuses on [[Computational complexity theory|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''.<ref>{{Cite journal|url = http://annals.math.princeton.edu/wp-content/uploads/annals-v160-n2-p12.pdf|title = Primes is in P|last1 = Agrawal|first1 = Manindra|journal = Annals of Mathematics|volume = 160|issue = 2|pages = 781–793|doi = 10.4007/annals.2004.160.781|last2 = Kayal|first2 = Neeraj|first3 = Nitin|last3 = Saxena|year = 2004|doi-access = free}}</ref> This research work came out as a part of his [[undergraduate]] study.

== Early life and education ==
He is an alumnus of [[Boys' High School & College (Allahabad, Uttar Pradesh)|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 [[Computer Engineering|Engineering]] of the same institute in 2006 with the Dissertation titled "Morphisms of Rings and Applications to Complexity".<ref>[http://www.math.uni-bonn.de/~saxena/papers/thesis.pdf Saxena's PhD thesis] {{webarchive|url=https://web.archive.org/web/20110716170330/http://www.math.uni-bonn.de/~saxena/papers/thesis.pdf |date=16 July 2011 }}</ref>

== 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.<ref>[http://www.cwi.nl/htbin/buro/latestnews?nr=78]{{dead link|date=February 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref> He was a Bonn Junior Fellow at the [[University of Bonn]] from Summer 2008 onwards.<ref name=bonn/> He joined the Department of Computer Science and Engineering at [[IIT Kanpur]] as faculty in April 2013.<ref>{{cite web|title=Department of Computer Science and Engineering, IIT Kanpur|url=http://www.cse.iitk.ac.in/|access-date=6 April 2013}}</ref>{{Better source needed|date=October 2020}}

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.<ref>https://researchmatters.in/news/prof-nitin-saxena-iit-kanpur-awarded-shanti-swarup-bhatnagar-prize-2018-his-work-algebraic</ref>

==References==
{{Reflist}}

==External links==
*[https://www.cse.iitk.ac.in/users/nitin/ Nitin Saxena's Homepage]
*[https://web.archive.org/web/20041222140659/http://www.iitkalumni.org/DAA/DAAProfile2.asp?id=39 Profile of Nitin Saxena at the IIT Kanpur Alumni Association]
*{{citation|title=Polynomial Identity Testing for Depth 3 Circuits|first1=Neeraj|last1=Kayal|first2=Nitin|last2=Saxena|author1-link= Neeraj Kayal|year=2005|id={{ECCC|2005|05|150}}}}.
*{{MathGenealogy |id=108308 }}
*{{google scholar id|1Yl1h_YAAAAJ}}

{{SSBPST recipients in Mathematical Science}}

{{Gödel winners}}

{{Authority control}}

{{DEFAULTSORT:Saxena, Nitin}}
[[Category:1981 births]]
[[Category:Living people]]
[[Category:Indian computer scientists]]
[[Category:Gödel Prize laureates]]
[[Category:Indian Institute of Technology Kanpur alumni]]
[[Category:University of Bonn faculty]]
[[Category:Recipients of the Shanti Swarup Bhatnagar Award in Mathematical Science]]

Nitin Saxena - Revision history

imported>OAbot: Open access bot: doi added to citation with #oabot.