Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
|
| gptkbp:complement |
NP
|
| gptkbp:contains |
gptkb:Graph_Non-3-Colorability
gptkb:Non-Hamiltonian_Graph gptkb:TAUT gptkb:UNSAT Integer Non-Feasibility Non-Path in Graph Non-Prime Number Non-Satisfiability of Boolean Formula |
| gptkbp:definedIn |
decision problems whose complement is in NP
|
| gptkbp:hasHardestProblems |
co-NP-complete problems
|
| gptkbp:hasSubgroup |
gptkb:PSPACE
|
| gptkbp:introducedIn |
gptkb:theoretical_computer_science
|
| gptkbp:openProblem |
Is NP = co-NP?
|
| gptkbp:relatedTo |
gptkb:co-NP-complete
NP-complete |
| gptkbp:bfsParent |
gptkb:complexity_theory
|
| gptkbp:bfsLayer |
4
|
| https://www.w3.org/2000/01/rdf-schema#label |
co-NP
|