Vinay Deolalikar appears to be set to do that very thing to a vast number of mathematicians and computer scientists, by suggesting some problems which can be verified in polynomial time can NEVER be s… more →
Drive Yardswrote 1 year ago: An view from some IBM theorists about the claimed proof that P does not equal NP Ken Clarkson is one … more →
wrote 1 year ago: Vinay Deolalikar, principal scientist at HP labs, has claimed that he has a proof of the problem P= … more →
wrote 1 year ago: P = NP or P != NP is an important and fundamental problem in mathematics and computer science. Vinay … more →
wrote 1 year ago: The Clay Mathematical Institute in the US has listed the P versus NP problem as one of seven so-call … more →
wrote 1 year ago: The internet has been abuzz over the past week about the possible resolution of the P vs NP problem. … more →
wrote 1 year ago: Vinay Deolalikar, a mathematician who works for HP Labs, claims to have proven that P is not equal t … more →
wrote 1 year ago: Vinay Deolalikar appears to be set to do that very thing to a vast number of mathematicians and comp … more →
wrote 1 year ago: The blogosphere is agog with news of possibly the biggest story in computer science, a serious proof … more →
wrote 1 year ago: August 8, 2010 After sending his paper to several leading researchers in the field and acquiring sup … more →
wrote 1 year ago: The problem of proving that P is not equal to NP is probably the most important and well known probl … more →