The AKS primality test, also known as the Agrawal-Kayal-Saxena primality test or 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 Institute of Technology Kanpur, on August 6, 2002, in an article titled PRIMES is in P. It was the first algorithm able to determine in polynomial time whether a given number is prime or composite without relying on mathematical conjectures such as the generalized Riemann hypothesis, and its proof is also notable for not relying on the field of analysis. In 2006 the authors received both the Godel Prize and the Fulkerson Prize for the work.
Facts
Time Complexity
Time Complexity (category)Polynomial Time -- O(n^k) 1 Connections
Credited To
Source AKS Primality Test (Wikipedia)
Source AKS Primality Test (Wikipedia)
Source AKS Primality Test (Wikipedia)
In Field
Source AKS Primality Test (Wikipedia)
Invented By
Manindra Agrawal co-developed the first known deterministic polynomial-time primality test with Neeraj Kayal and Nitin Saxena, published in 2002.
Source Wikipedia: Manindra Agrawal
Neeraj Kayal co-developed the first known deterministic polynomial-time primality test with Manindra Agrawal and Nitin Saxena, published in 2002.
Nitin Saxena co-developed the first known deterministic polynomial-time primality test with Manindra Agrawal and Neeraj Kayal, published in 2002.
Sources
1. AKS Primality Test (Wikipedia)
Wikipedia infobox: time complexity polynomial
polynomial
In Field: Algorithms and Complexity Theory, 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
Credited To: Manindra Agrawal, 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
Credited To: Neeraj Kayal, 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
Credited To: Nitin Saxena, 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
View the SourceWikidata: AKS Primality Test
Wikidata Q294284, class allow-list match (w-wdresolver-0926)View the Source 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.