P != NP Proved By Vinay Deolalikar
By Avik, Gaea News NetworkMonday, August 9, 2010
NEW DELHI, INDIA (GaeaTimes.com) — One of the most complex problems of computer science and technology gets solved. Vinay Deolalikar has produced a paper that claims to prove P does not equal NP. He is a well known researcher in networks and complexity theory from HP Labs.
What is more interesting is that there is a hopping amount of 1 million assigned to the person who solves this problem. Now this is what is making this news big. Mr. Deolalikar did his work on the problem in his spare time. After finishing his work he informed fellow members and renowned researchers about his paper on NP. Though, the paper is yet to be validated but the information already has been allegedly leaked without putting any prior notice to Vinay. He had been working on NP problems previously also. He was successful in proving the fact that P is smaller than NP for infinite time Turing Machines.
Deolalikar states that after his paper goes through the proceedings a final version will be available on his web page in about a week. Well, as of now you can cope up with your thirst with this. If you come to know more facts, do care to post to us.
