Here is a print friendly version of the article.
Search:
Tuesday, May 22, 2012
Wednesday, August 11, 2010

Computer scientist Vinay Deolalikar claims to have solved maths riddle of P vs NP

A computer scientist claims to have solved one of the world’s most complex and intractable mathematical problems by proving that P≠NP.
August 11, 2010
“Vinay Deolalikar, who works at the research arm of Hewlett-Packard in Palo Alto, California, believes he has solved the riddle of P vs NP in a move that could transform mankind’s use of computers as well as earn him a $1m prize.

P vs NP is one of the seven millennium problems set out by the Massachusetts-based Clay Mathematical Institute as being the “most difficult” to solve.

Click to read the full story in Daily Telegraph

Vinay Deolalikar’s Paper