A mathematician of Indian origin (Vinay Deolalikar), settled, as expected in the USofA, has done something extraordinary. The P=NP ? conundrum has vexed mathematicians ever since it was introiduced. It was introduced in 1971 by Stephen Cook in his paper "The complexity of theorem proving procedures", and is considered by many to be the most important problem in the field of mathematics. The problem definition/statement itself is not easy to grasp. And now, a young Indian, breaks this mystery and comes with the answer (a NO).
I did a Google search "P=NP Deolalikar" and got 30 results. You can read about this achievement at::
The paper still needs to be published in a major refereed journal and then be “generally accepted” by the mathematical community within two years of publication for Deolalikar to collect his Clay prize.
But experts have agreed, after preliminary readings, that his paper is an effort worthy of study.
Stephen Cook, who has written the official description of the P=NP problem for the Clay Institute, has called it “a relatively serious claim to have solved P vs NP”.
There is also a wiki page at http://en.wikipedia.org/wiki/P_versus_NP_problem whih explains the P=NP problem.
Take a look.
PS:: The "International Congress of Mathematicians 2010", the world's biggest maths conference will be held in Hyderabad next week. See :: http://www.icm2010.org.in/