Karp reduction

GPTKB entity

Statements (18)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
Computational complexity theory concept
gptkbp:alsoKnownAs gptkb:Polynomial-time_many-one_reduction
gptkbp:appliesTo Decision problems
gptkbp:category gptkb:Reduction_(complexity)
gptkbp:contrastsWith gptkb:Turing_reduction
gptkbp:defines A function f from instances of problem A to instances of problem B such that x is a yes-instance of A if and only if f(x) is a yes-instance of B, and f is computable in polynomial time.
https://www.w3.org/2000/01/rdf-schema#label Karp reduction
gptkbp:importantFor Proving NP-completeness
gptkbp:introduced gptkb:Richard_Karp
gptkbp:introducedIn 1972
gptkbp:mapType One decision problem to another
gptkbp:namedAfter gptkb:Richard_Karp
gptkbp:preserves gptkb:Polynomial-time_computability
gptkbp:usedIn gptkb:Complexity_theory
gptkb:NP-completeness
gptkbp:bfsParent gptkb:Richard_M._Karp
gptkbp:bfsLayer 4