Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complement |
NP-complete
|
| gptkbp:contains |
gptkb:TAUTOLOGY_problem
|
| gptkbp:definedIn |
the set of decision problems in co-NP to which every problem in co-NP can be reduced in polynomial time
|
| gptkbp:example |
gptkb:Integer_Linear_Programming_Feasibility_(complement)
gptkb:TAUTOLOGY UNSATISFIABILITY |
| gptkbp:hasProperty |
hardest problems in co-NP
if any co-NP-complete problem is not in P, then co-NP ≠ P if any co-NP-complete problem is in P, then co-NP = P |
| gptkbp:hasReductionType |
gptkb:polynomial-time_many-one_reduction
|
| gptkbp:hasSubgroup |
gptkb:co-NP
P if P = co-NP |
| https://www.w3.org/2000/01/rdf-schema#label |
co-NP-complete
|
| gptkbp:introducedIn |
theoretical computer science
|
| gptkbp:relatedTo |
gptkb:co-NP
NP-complete |
| gptkbp:bfsParent |
gptkb:co-NP
|
| gptkbp:bfsLayer |
5
|