Talk:NP complexity class: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Warren Schudy
No edit summary
imported>Sandy Harris
(Claimed proof!)
Line 13: Line 13:


--[[User:Warren Schudy|Warren Schudy]] 12:14, 18 November 2007 (CST) Wikipedia uses "NP (complexity)" for the title. Is that a better name?
--[[User:Warren Schudy|Warren Schudy]] 12:14, 18 November 2007 (CST) Wikipedia uses "NP (complexity)" for the title. Is that a better name?
== Claimed proof ==
There's a claimed proof for P not equal to NP.
PDF at author's page:
http://www.hpl.hp.com/personal/Vinay_Deolalikar/
He says this is a preliminary version, actual paper is a few weeks away.

Revision as of 00:19, 9 August 2010

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. [d] [e]
Checklist and Archives
 Workgroup categories Mathematics and Computers [Please add or review categories]
 Talk Archive none  English language variant British English

TODO:

  • Add formal definitions for P, NP, reduction
  • Add citations everywhere
  • Make branch and bound section
  • add disambiguation page for "NP" that links here

--Warren Schudy 23:55, 12 November 2007 (CST) Why does the subpages template produce that green notice about seeking approval? This article is far from that point!

Don't worry, just a placeholder :) Aleksander Stos 12:41, 13 November 2007 (CST)

--Warren Schudy 11:50, 18 November 2007 (CST) I added a todo list at the top of the page. Please feel free to edit it.

--Warren Schudy 12:14, 18 November 2007 (CST) Wikipedia uses "NP (complexity)" for the title. Is that a better name?

Claimed proof

There's a claimed proof for P not equal to NP.

PDF at author's page: http://www.hpl.hp.com/personal/Vinay_Deolalikar/ He says this is a preliminary version, actual paper is a few weeks away.