Lance Fortnow on the current status and future outlook of solving the P-NP problem.

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher ...

A diagram showing the relevant complexity classes in the P vs NP problem. “P” problems are solvable in polynomial time; “NP” problems might be solvable in polynomial time, and are checkable in ...

A new proof, published to the Web less than one week ago, purports to finally demonstrate that, in complexity theory, P != NP. As fast as the proof went up though, people found some potential issues ...

Is it possible to invent a computer that computes anything in a flash? Or could some problems stump even the most powerful of computers? Computational complexity theorists study these questions and ...