Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complement |
gptkb:NP_(complexity_class)
|
| gptkbp:contains |
TAUT (tautology problem)
UNSAT (unsatisfiability problem) graph non-3-colorability integer non-square problem |
| gptkbp:definedIn |
set of decision problems whose complement is in NP
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:hasSubgroup |
gptkb:P_(complexity_class)
gptkb:PSPACE_(complexity_class) |
| https://www.w3.org/2000/01/rdf-schema#label |
co-NP (complexity class)
|
| gptkbp:introduced |
gptkb:Stephen_Cook
|
| gptkbp:introducedIn |
1971
|
| gptkbp:loveInterest |
gptkb:NP_(complexity_class)
|
| gptkbp:notation |
gptkb:co-NP
gptkb:coNP |
| gptkbp:openQuestion |
Is NP equal to co-NP?
|
| gptkbp:relatedTo |
gptkb:co-NP-complete
NP-complete Boolean satisfiability problem polynomial time reduction |
| gptkbp:bfsParent |
gptkb:NP_(complexity_class)
|
| gptkbp:bfsLayer |
6
|