A paper that leaked onto the Web late last week claims to have solved one of the great modern problems in mathematics and computer science. Vinay Deolalikar, a principal research scientist at HP labs, ...

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

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

London: An Indian-origin computer scientist based in the US claims to have solved one of the world's most complex mathematical riddles. Vinay Deolalikar, who works with IT giant Hewlett-Packard in ...

The biggest problem in computer science remains unsolved, but researchers are more confident than ever about what the answer should be. A new poll reveals opinions on the P versus NP problem, the ...

"The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can ...

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