Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
|
| gptkbp:contrastsWith |
gptkb:NP-hard
NP-complete |
| gptkbp:definedIn |
gptkb:Ladner's_theorem
|
| gptkbp:defines |
A problem is NP-easy if it can be solved in polynomial time given an oracle for some NP problem.
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:hasSubgroup |
gptkb:NP/poly
|
| gptkbp:relatedTo |
gptkb:NP-hard
NP NP-complete |
| gptkbp:seeAlso |
gptkb:NP-intermediate
|
| gptkbp:usedIn |
reduction theory
oracle machines |
| gptkbp:bfsParent |
gptkb:NP-hard
|
| gptkbp:bfsLayer |
6
|
| http://www.w3.org/2000/01/rdf-schema#label |
NP-easy
|