| 词条 | Nitin Saxena |
| 释义 |
| name = Nitin Saxena | image = | image_size = | caption = | birth_date = {{Birth date and age|1981|05|03|df=y}} | birth_place = Allahabad, India | death_date = | death_place = | nationality = Indian | fields = Mathematics Theoretical computer science | workplaces = CWI AmsterdamUniversity of BonnIndian Institute of Technology Kanpur | alma_mater = Indian Institute of Technology Kanpur | doctoral_advisor = Manindra Agrawal | doctoral_students = | known_for = | awards = 2006 Gödel Prize 2006 Fulkerson Prize }} Nitin Saxena ({{lang-hi|नितिन सक्सेना}}) (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. 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] 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] Prof. Nitin Saxena, Professor at the Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, has been awarded the 2018 Shanti Swarup Bhatnagar Prize for his work in Algebraic Complexity Theory. One of the youngest awardees, Prof. Saxena’s research interests include Computational Complexity and Algebraic Geometry. The Shanti Swarup Bhatnagar Prize, named after the founder of the Council of Scientific and Industrial Research (CSIR), is awarded for outstanding and notable research in the field of science and engineering. It includes Rs 5,00,000 prize money, a citation plaque and a fellowship till the age of 45. References1. ^1 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 }} 2. ^{{Cite journal|url = http://annals.math.princeton.edu/wp-content/uploads/annals-v160-n2-p12.pdf|title = Primes is in P|last = Agrawal|first = Manindra|date = |journal = Annals of Mathematics|doi = 10.4007/annals.2004.160.781|pmid = |access-date = |last2 = Kayal|first2 = Neeraj|first3 = Nitin|last3 = Saxena}} 3. ^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 }} 4. ^ {{dead link|date=February 2018 |bot=InternetArchiveBot |fix-attempted=yes }} 5. ^{{cite web|title=Department of Computer Science and Engineering, IIT Kanpur|url=http://www.cse.iitk.ac.in/|accessdate=6 April 2013}} External links
6 : 1981 births|Living people|Indian computer scientists|Gödel Prize laureates|Indian Institute of Technology Kanpur alumni|University of Bonn faculty |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。