Karp reduction
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Richard Karp.
Noun[edit]
Karp reduction (countable and uncountable, plural Karp reductions)
- (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.