Karp reduction
English
Etymology
Named after Richard Karp.
Noun
Karp reduction (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.
Related terms
- Karp-reducible
- Karp-reducibility
This article is issued from
Wiktionary.
The text is licensed under Creative
Commons - Attribution - Sharealike.
Additional terms may apply for the media files.