Statements (34)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Computational Complexity Class
|
| gptkbp:characterizedBy |
At least as hard as the hardest problems in NP
|
| gptkbp:contrastsWith |
NP Problem
NP-complete Problem NP-easy Problem P Problem |
| gptkbp:definedIn |
Computational Complexity Theory
|
| gptkbp:example |
gptkb:Decision_Problem
Optimization Problem Search Problem |
| gptkbp:hasProperty |
No known polynomial-time solution
Verification may not be in polynomial time |
| gptkbp:hasSuperClass |
EXPTIME-hard Problem
PSPACE-hard Problem |
| https://www.w3.org/2000/01/rdf-schema#label |
NP-hard Problem
|
| gptkbp:includes |
gptkb:Traveling_Salesman_Problem_(optimization_version)
Halting Problem NP-complete Problem Boolean Satisfiability Problem (optimization version) |
| gptkbp:introduced |
gptkb:Richard_Karp
gptkb:Stephen_Cook |
| gptkbp:introducedIn |
1970s
|
| gptkbp:mayNotBe |
In NP
|
| gptkbp:notSolvableBy |
Polynomial Time Algorithms (unless P=NP)
|
| gptkbp:relatedTo |
gptkb:P_vs_NP_Problem
NP-complete Problem |
| gptkbp:solvedBy |
Exponential Time Algorithms
|
| gptkbp:subclassOf |
NP-complete Problem
|
| gptkbp:usedIn |
gptkb:Algorithm_Design
Cryptography Operations Research Theoretical Computer Science |
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
|
| gptkbp:bfsLayer |
7
|