Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity concept
|
| gptkbp:alsoKnownAs |
gptkb:polynomial-time_many-one_reduction
|
| gptkbp:appliesTo |
decision problems
|
| https://www.w3.org/2000/01/rdf-schema#label |
Levin reduction
|
| gptkbp:introducedIn |
1973
|
| gptkbp:mapType |
instances of one decision problem to another
|
| gptkbp:namedAfter |
gptkb:Leonid_Levin
|
| gptkbp:preserves |
polynomial-time computability
|
| gptkbp:relatedTo |
gptkb:Karp_reduction
Cook reduction |
| gptkbp:usedFor |
proving NP-completeness
|
| gptkbp:usedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:Leonid_Levin
|
| gptkbp:bfsLayer |
5
|