P vs NP problem solved?
The relationship between the complexity classes P (Polynomial time) and NP (Nondeterministic Polynomial time) is an unsolved problem in theoretical computer science, and is considered by many theoretical computer scientists to be the most important problem in the field. The Clay Mathematics Institute, which is dedicated to increasing and disseminating mathematical knowledge, has included it in its list of Millennium Prize Problems; anyone who provides a satisfactory solution to the problem may be entitled to a USD $1,000,000 prize.
In August 6th, Vinay Deolalikar claimed to have proven P ≠ NP. The paper still needs specialist proof-reading.
Scott Aaronson, an MIT professor, wrote at his blog that he doesn’t plan to interrupt his vacation time in Israel and Greece, unless other experts who have studied the paper in detail find the solution satisfactory. In that case he’ll also personally supplement the million dollar prize by the amount of $200,000.
Read more about the P vs NP problem at Wikipedia.
hy is it posible to think that the last theorem of fermat is an example of a NP problem ?? just because it was imposible for computers to find a solution… but in the same way it was easily verified for some numbers..
Extraordinary subject matter here. I’m rather motivated. I’ll inform my friends.