Tag Archives: complexity

Does P ≠ NP Matter?

This week we’ve been lucky enough to have one of the biggest computer science stories break in recent memory, Dr. Vinay Deolalikar submitted a proof for the classic Complexity Theory problem of P ≠ NP. While this is ground breaking … Continue reading

Posted in Uncategorized | Tagged , , | 1 Comment

Initial Reaction to New P!=NP Paper

UPDATED: A wiki page has been created on the polymath project wiki to discuss the proof as well as provide background on P=NP and a really thorough round-up of recent articles and discussion on the problem. The internet is abuzz … Continue reading

Posted in Uncategorized | Tagged , , | 1 Comment

New Paper Claims Proof P!=NP

Greg Baker has broken the news on his blog of a new 100-page paper from researcher Vinay Deolalikar claiming to prove P≠NP. The paper has not been peer-reviewed yet. Vinay is a Principal Research Scientist at HP Labs with a … Continue reading

Posted in Uncategorized | Tagged , , | 1 Comment