Nitin Saxena

Last updated

Nitin Saxena
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
Nitin Saxena receiving Shanti Swarup Bhatnagar Prize from Narendra Modi
Born (1981-05-03) 3 May 1981 (age 42)
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.

Contents

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.

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]

Related Research Articles

A primality test is an algorithm for determining whether an input number is prime. Among other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating whether the input number is prime or not. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy. Some primality tests prove that a number is prime, while others like Miller–Rabin prove that a number is composite. Therefore, the latter might more accurately be called compositeness tests instead of primality tests.

The AKS primality 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 and this 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 computational complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output is more complex than that of a decision problem. For function problems, the output is not simply 'yes' or 'no'.

<span class="mw-page-title-main">Manindra Agrawal</span> Indian computer scientist

Manindra Agrawal is an Indian computer scientist and professor at the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur. He was the recipient of the first Infosys Prize for Mathematics, the Godel Prize in 2006; and the Shanti Swarup Bhatnagar Award in Mathematical Sciences in 2003. He has been honoured with Padma Shri, India's 4th highest civilian award, in 2013.

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

Neeraj Kayal 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.

In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime. Primality certificates allow the primality of a number to be rapidly checked without having to run an expensive or unreliable primality test. "Succinct" usually means that the proof should be at most polynomially larger than the number of digits in the number itself.

Sanjay Mittal is a Professor of computational fluid dynamics in the Department of Aerospace Engineering at Indian Institute of Technology Kanpur, India.

Kalyanmoy Deb is an Indian computer scientist. Deb is the Herman E. & Ruth J. Koenig Endowed Chair Professor in the Department of Electrical and Computing Engineering at Michigan State University. Deb is also a professor in the Department of Computer Science and Engineering and the Department of Mechanical Engineering at Michigan State University.

In computational complexity theory and the analysis of algorithms, an algorithm is said to take quasi-polynomial time if its time complexity is quasi-polynomially bounded. That is, there should exist a constant such that the worst-case running time of the algorithm, on inputs of size , has an upper bound of the form

In number theory, Agrawal's conjecture, due to Manindra Agrawal in 2002, forms the basis for the cyclotomic AKS test. Agrawal's conjecture states formally:

Trivandrum Ramakrishnan "T. R." Ramadas is an Indian mathematician who specializes in algebraic and differential geometry, and mathematical physics. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology in 1998, the highest science award in India, in the mathematical sciences category.

<span class="mw-page-title-main">Kapil Hari Paranjape</span> Indian mathematician

Kapil Hari Paranjape is an Indian mathematician specializing in algebraic geometry. He is a Professor of Mathematics at the Indian Institute of Science Education and Research, Mohali.

Jaikumar Radhakrishnan is an Indian computer scientist specialising in combinatorics and communication complexity. He has served as dean of the School of Technology and Computer Science at the Tata Institute of Fundamental Research, Mumbai, India, where he is currently a senior professor.

Amalendu Krishna is an Indian mathematician in the Department of Mathematics, Indian Institute of Science (IISc), Bangalore, specializing in algebraic cycles and K-theory. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology, India's highest prize for excellence in science, mathematics and technology, in the mathematical sciences category in the year 2016.

Amalendu Chandra is an Indian theoretical physical chemist, a professor and the head of the Department of Chemistry at the Indian Institute of Technology, Kanpur. He is known for his microscopic theories and simulations on liquids, interface and clusters. He is an elected fellow of the Indian Academy of Sciences and the Indian National Science Academy. The Council of Scientific and Industrial Research, the apex agency of the Government of India for scientific research, awarded him the Shanti Swarup Bhatnagar Prize for Science and Technology, one of the highest Indian science awards, in 2007, for his contributions to chemical sciences.

Mangalore Anantha Pai was an Indian electrical engineer, academic and a Professor Emeritus at the University of Illinois at Urbana–Champaign. A former professor of electrical engineering at the Indian Institute of Technology, Kanpur, he is known for his contributions in the fields of power stability, power grids, large scale power system analysis, system security and optimal control of nuclear reactors and he has published 8 books and several articles. Pai is the first India born scientist to be awarded a PhD in Electrical Engineering from the University of California, Berkeley.

<span class="mw-page-title-main">Yogesh M. Joshi</span> Indian chemical engineer (born 1974)

Yogesh Moreshwar Joshi is an Indian chemical engineer, rheologist and the Pandit Girish & Sushma Rani Pathak Chair Professor at the Indian Institute of Technology, Kanpur. He is known for his studies on metastable soft matter and is an elected fellow of the Society of Rheology, Indian National Science Academy, Indian Academy of Sciences, and Indian National Academy of Engineering. In 2015, the Council of Scientific and Industrial Research, the apex agency of the Government of India for scientific research, awarded Joshi the Shanti Swarup Bhatnagar Prize for Science and Technology for his contributions to Engineering Sciences. In 2023, he received prestigious J C Bose fellowship constituted by the Science and Engineering Research Board, Government of India.

<span class="mw-page-title-main">Amit Kumar (academic)</span> Indian computer scientist and academic (born 1976)

Amit Kumar is Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Delhi. He received his B.Tech. degree from Indian Institute of Technology Kanpur in 1997, and Ph.D. from Cornell University in 2002. He worked as Member of Technical Staff at Bell Labs, Murray Hill, New Jersey, U.S. during 2002–2003. He joined IIT Delhi as faculty member in 2003. He works in the area of combinatorial optimization, approximation algorithms and online algorithms. He is working extensively on problems arising in scheduling theory, clustering, and graph theoretic algorithmic problems.

Amit Agrawal is an Indian engineer and an institute chair professor at the department of mechanical engineering of the Indian Institute of Technology, Bombay. He leads a group of scientists who are involved in the development of next-generation diagnostic microdevices.

References

  1. 1 2 Saxena's CV at University of Bonn Archived 24 August 2009 at the Wayback Machine
  2. 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 .
  3. Saxena's PhD thesis Archived 16 July 2011 at the Wayback Machine
  4. [ permanent dead link ]
  5. "Department of Computer Science and Engineering, IIT Kanpur" . Retrieved 6 April 2013.
  6. "Prof Nitin Saxena from IIT Kanpur awarded the Shanti Swarup Bhatnagar Prize 2018 for his work on algebraic circuits". 15 November 2018.