Has the biggest question in computer science been solved? On 6 August, Vinay Deolalikar, a mathematician at Hewlett-Packard Labs in Palo Alto, California, sent out draft copies of a paper titled ...

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 ...

Last week, HP Labs mathematician Vinay Deolalikar started circulating a startling paper that claims to have solved the preeminent open problem in computer science, known as P = NP. Er, more accurately ...

A draft solution to the so-called “P versus NP” problem generated excitement in 2010 – will 2011 bring a correct proof? Vinay Deolalikar made waves in August when his draft solution to a mathematical ...

Has the biggest question in computer science been solved? On 6 August, Vinay Deolalikar, a mathematician at Hewlett-Packard Labs in Palo Alto, California, sent out draft copies of a paper titled ...