Definition: A transformation of one problem into another which is computable in polynomial time.
See also NP-complete, Turing reduction, Cook reduction, Karp reduction, l-reduction, many-one reduction.
Note: From Algorithms and Theory of Computation Handbook, page 24-19, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue Jan 16 10:34:44 2018.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "polynomial-time reduction", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/polynomtredc.html