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
Connections
Credited
Source AKS Primality Test (Wikipedia)
In Field
Source Wikipedia: Nitin Saxena
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
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Nitin Saxena
Wikimedia FoundationLead 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 2. Wikidata: Nitin Saxena
Wikidata Q3634379, class allow-list match (w-wdresolver-0926)View the Source AKS Primality Test (Wikipedia)
Credited: AKS Primality Test, Lead sentenceQuote, Credited: AKS Primality Test, Lead sentence
AKS primality test (also known as the Agrawal-Kayal-Saxena primality test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian I
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.