P vs NP Problem Solved By HP Scientist

more images

SAN FRANCISCO (GaeaTimes.com)- A scientist of Indian origin has claimed that he has found the solution to the P vs NP problem that has eluded the mathematicians all over the world for decades. Vinay Deolalikar, a scientist for the HP laboratories will become eligible for the $1 million prize money from the Clay Mathematics Institute if his solution to the problem is approved. MIT professor Scott Aaronson has also promised another $200,000 to the scientist if his claim turns out to be true.

The P vs NP problem is considered the most difficult among the 7 Millennium Prize Problems by the Clay Mathematics Institute. The solution to the problem will have a great deal of application in the aviation industry as well as in cryptography. Scott Aaronson has however shown some skepticism about the solution offered by the Indian scientist and said that it will not hold long enough. The proof by Vinay Deolalikar has been released all over the web and maths bloggers all over the world have given their mixed reactions after studying it.

The problem of P vs NP deals with the time taken to solve a problem. Considering the amount of time taken to check the solution of a problem, they are categorized into classes P and NP. The solution by Vinay Deolalikar implies that a solution which takes less time to check must be of a problem that is easy to solve. Many scientist agree with Vinay Deolalikar that P is not equal to NP but the proof by the HP scientist will cause a great barrier to be broken in the field of mathematics.