NP complexity class/Definition

From Citizendium
< NP complexity class
Revision as of 10:20, 4 September 2009 by imported>Meg Taylor (add)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=NP_complexity_class/Definition&printable=yes
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'.

Retrieved from "https://citizendium.org/wiki/index.php?title=NP_complexity_class/Definition&oldid=682420"