P Vs NP Problem Actually Solved?

A scientist working in HP Laboratories has claimed That they has found a solution to the mathematical problem called the "P vs NP" That will make him Eligible for the $ 1 million prize from the Clay Mathematics Institute. Considered one of the seven Millennium Prize Problems, the achievement Could Be a great one for Further research. The man behind the claim, Vinay Deolalikar has Revealed That they did the research without informing at his friends or fellow Researchers. 

Scott Aaronson, a professor at MIT has also Life Style Promised to Pay an Additional $ 200,000 Thurs Vinay Deolalikar if at his solution to the P vs NP problem is Approved. He has added That though the amount is Difficult for him Thurs AFFORD, the solution will change at his life to a great extent. Considered the most Difficult Among the Seven Millennium Problems by the Clay Mathematics Institute, the solution will offer great Insights in cracking code and flight scheduling. Michael Sipser of MIT has Said That the solution to the P vs NP problem will Give Researchers better Computational Insights into complexities. That, they added the solution will not have a major application in the area cryptography. Scott Aaronson, however, has shown Skepticism about the solution by Vinay Deolalikar. 

The P vs NP problem deals with the speed at wakes a computer can find a solution to a problem like a factorization. The Technical That definition implies the running time is proportional to the Polynomial function of the input size. The Problems are categorized into class P and NP based on the speed at wakes They Can Be Checked. If P is found to Be Equal "Thurs NP then it'd imply That all the Problems That are easy to be checked are easy to solve.