NP complexity class/Definition: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Meg Taylor
(add)
 
imported>Daniel Mietchen
(added link to Millennium Prize Problems)
Line 1: Line 1:
<noinclude>{{Subpages}}</noinclude>
<noinclude>{{Subpages}}</noinclude>


Set of all decision problems for which the 'yes'-answers have simple proofs of the fact that the answer is indeed 'yes'.
Set of all decision problems for which the 'yes'-answers have simple proofs of the fact that the answer is indeed 'yes'; one of the [[Millennium Prize Problems]].

Revision as of 07:51, 13 August 2010

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A definition or brief description of NP complexity class.

Set of all decision problems for which the 'yes'-answers have simple proofs of the fact that the answer is indeed 'yes'; one of the Millennium Prize Problems.