Karp reduction

Named after Richard Karp.

Karp reduction (countable and uncountable, plural Karp reductions)

1. (computing theory) A polynomial-time algorithm for transforming inputs to one problem into inputs to another problem, such that the transformed problem has the same output as the original.

• Karp-reducible
• Karp-reducibility