London: An Indian-origin computer scientist based in the US claims to have solved one of the world's most complex mathematical riddles
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", Daily Telegraph reported Wednesday. The Massachusetts-based Clay Mathematical Institute has categorised "P vs NP" as one of the seven millennium problems. It is considered the "most difficult" one to be solved
Deolalikar 's paper that was posted online Friday claims that P, which refers to problems whose solutions are easy to find and verify, is not the same as NP, which refers to problems whose solutions are almost impossible to find but easy to verify, the report said.
0 comments:
Post a Comment