Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Nitin Saxena

Theory of Computation

Nitin Saxena is an Indian mathematician and theoretical computer scientist who, as an undergraduate, coauthored the AKS primality test with Manindra Agrawal and Neeraj Kayal in 2002, the first algorithm proven to determine whether a given number is prime in time that grows only polynomially with the number of digits, without relying on any unproven conjecture. The result earned the three authors the 2006 Godel Prize and Fulkerson Prize, and Saxena later received Indias Shanti Swarup Bhatnagar Prize in 2018 for his continuing work in algebraic complexity theory.

Facts
Birth Year
1981 1
Birth Date
1981-05-03 1
Nationality
Indian 1
Connections

Invented

Nitin Saxena co-developed the first known deterministic polynomial-time primality test with Manindra Agrawal and Neeraj Kayal, published in 2002.

In the Other Atlases
Sources
1. Wikipedia: Nitin Saxena
Wikimedia Foundation
  • Lead paragraph, first sentence
    Nitin Saxena (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science.
  • Lead paragraph
    is an Indian scientist in mathematics and theoretical computer science
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.