Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity property
|
| gptkbp:appliesTo |
decision problems
search problems function problems |
| gptkbp:category |
theoretical computer science
|
| gptkbp:contrastsWith |
gptkb:NP-hardness
P-completeness L-hardness |
| gptkbp:definedIn |
polynomial-time reductions
|
| https://www.w3.org/2000/01/rdf-schema#label |
P-hardness
|
| gptkbp:implies |
problem is at least as hard as any problem in P
|
| gptkbp:meaning |
at least as hard as the hardest problems in P
|
| gptkbp:relatedTo |
gptkb:P_(complexity_class)
theoretical computer science |
| gptkbp:usedIn |
complexity class reductions
|
| gptkbp:bfsParent |
gptkb:NP-hardness
|
| gptkbp:bfsLayer |
6
|