---
title: Polynomial-time computability of prime numbers
date: "2002-08-27T12:00:00Z"
categories:
  - links
wp_id: 1199
description: 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.
keywords: [aks primality test, primality testing, computational complexity, polynomial time, number theory, p vs np]
---

Progress on the [polynomial-time computability of prime numbers](http://www.wired.com/news/technology/0,1282,54613,00.html).