Vinay Deolalikar explains the proof that P = NP
Linkedin

Vinay Deolalikar explains the proof that P = NP

San Francisco : CA : USA | Aug 09, 2010 at 4:56 AM PDT
XX XX
Views: Pending
 

It seems that well-known researcher Vinay Deolalikar is onto something big in the world of computer science.

A paper has been produced by Vinay Deolalikar, who works in networks and complexity theory in HP labs, which claims to prove the solution of the most important and renowned problem that is P is not equal to NP.

The big news of the problem solving by Vinay Deolalikar hit the web, as it is one of the Millennium Prize problems and worth one million dollar prize for the problem solver.

It has been reported that Vinay Deolalikar worked out on problem in his leisure time and finally when he came up with the breakthrough solution, Vinay sent his outstanding paper to leading researchers.

The paper by Vinay Deolalikar has been published on the web; however, the status of the paper is not confirmed yet. The confirmation or flaws of the proof are normally settled by peer review, which will take time.

However, the suitable track record of Vinay Deolalikar and his proof, which stated that P was smaller than NP for infinite time Turing Machines, lessen the chances of errors. If the final verdict reached in favor of Vinay Deolalikar, a jackpot is waiting for him.

1 of 1
Vinay Deolalikar
The problem solution news hits the web.
faliciasmith is based in Philadelphia, Pennsylvania, United States of America, and is an Anchor for Allvoices.
Report Credibility
 
  • Clear
  • Share:
  • Share
  • Clear
  • Clear
  • Clear
  • Clear
 
 
 
Advertisement
 

News Stories

 

Blogs

 >

Images

 >
 

More From Allvoices

Report Your News Got a similar story?
Add it to the network!

Or add related content to this report



Use of this site is governed by our Terms of Use Agreement and Privacy Policy.

© Allvoices, Inc. 2008-2014. All rights reserved. Powered by PulsePoint.