NIST

Karp reduction

(definition)

Definition: A reduction given by a polynomial time computable transformation function.

See also NP-complete, Turing reduction, Cook reduction, l-reduction, many-one reduction, polynomial-time reduction.

Note: From Algorithms and Theory of Computation Handbook, page 28-25, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Tue May 6 13:48:55 2014.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "Karp reduction", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/karpreductin.html