On August 6, 2002, Agrawal, Kayal and Saxena announced a breakthrough: a deterministic polynomial-time algorithm recognizing prime numbers (AKS algorithm). This is one of the most important results in CS theory in the last few decades.
back to spr's main page
December 13, 2002