Progress on the polynomial-time computability of prime numbers.
Polynomial-time computability of prime numbers
Track the 2002 discovery of the AKS primality test, a deterministic polynomial-time algorithm for determining if a number is prime, finally placing primality testing within the complexity class P.