Polynomial-time many-one reduction
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Computational complexity concept
|
| gptkbp:alsoKnownAs |
gptkb:Karp_reduction
|
| gptkbp:category |
Reductions (complexity)
|
| gptkbp:computationalClass |
P
NP |
| gptkbp:definedIn |
A function computable in polynomial time
|
| https://www.w3.org/2000/01/rdf-schema#label |
Polynomial-time many-one reduction
|
| gptkbp:implies |
If A ≤_m^P B and B ∈ P, then A ∈ P
|
| gptkbp:introduced |
gptkb:Richard_Karp
|
| gptkbp:introducedIn |
1972
|
| gptkbp:mapType |
Instances of one decision problem to another
|
| gptkbp:preserves |
Yes-instances and no-instances
|
| gptkbp:relatedTo |
Cook reduction
Polynomial-time Turing reduction |
| gptkbp:symbol |
≤_m^P
|
| gptkbp:type |
Many-one reduction
|
| gptkbp:usedIn |
gptkb:Complexity_theory
gptkb:NP-completeness |
| gptkbp:uses |
gptkb:NP-completeness
|
| gptkbp:bfsParent |
gptkb:Karp_reduction
|
| gptkbp:bfsLayer |
5
|