Karp reduction

English

Etymology

Named after Richard Karp.

Noun

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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.