LePolytechnicien.org

Whether P (class of problems solvable in polynomial time) is not equal NP (class of problems solvable by a non-deterministic Turing machine in Polynomial time) is probably the most important problem in theoretical computer science, and is among Clay Mathematics Institute Millennium Prize Problems with a million dollar prize. (Wikipedia: P versus NP problem).

Vinay Deolalikar is a Principal Research Scientist at HP Labs who has done important research in various areas of networks. He also has worked on complexity theory, including previous work on infinite versions of the P=NP question. He has just claimed that he has a proof that P is not equal to NP, by using an approach which combines ideas from logic, statistics, graphical models, random ensembles, and statistical physics.

Source:

http://www.kdnuggets.com/2010/08/f-p-not-equal-np-proved.html