Editing AKS primality test (section)

{{Short description|Algorithm checking for prime numbers}}
The '''AKS primality test''' (also known as '''Agrawal–Kayal–Saxena primality test''' and '''cyclotomic AKS test''') is a [[deterministic algorithm|deterministic]] [[primality test|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".<ref name="AKS">{{cite journal |first1=Manindra |last1=Agrawal |first2=Neeraj |last2=Kayal |first3=Nitin |last3=Saxena |url=http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf |title=PRIMES is in P |journal=[[Annals of Mathematics]] |volume=160 |year=2004 |issue=2 |pages=781–793 |doi=10.4007/annals.2004.160.781 |jstor=3597229 |doi-access=free }}</ref> The algorithm was the first one which is able to determine in [[polynomial time]], whether a given number is [[Prime number|prime]] or [[Composite number|composite]] without relying on [[mathematical conjecture]]s such as the [[generalized Riemann hypothesis]]. The proof is also notable for not relying on the field of [[analysis (mathematics)|analysis]].<ref>{{cite journal|first=Andrew|last=Granville|url=https://www.ams.org/bull/2005-42-01/S0273-0979-04-01037-7/home.html|title=It is easy to determine whether a given integer is prime|journal=Bull. Amer. Math. Soc.|volume=42|year=2005|pages=3–38|doi=10.1090/S0273-0979-04-01037-7|doi-access=free}}</ref> In 2006 the authors received both the [[Gödel Prize]] and [[Fulkerson Prize]] for their work.