P versus NP problem Solved by Indian Origin Scientist
Vinay Deolalikar, who works with the US multinational information technology corporation Hewlett-Packard in California, believes he has solved the problem of "P versus NP".
t is considered the "most difficult" one to be solved.
If his claim is proved correct, Deolalikar stands to earn a $1 million prize. 😀
P.S: Mathematicians Stephen Cook and Leonid Levin formalised the problem in 1971.