NC many-one reducibility

(definition)

Definition: A language L is NC many-one reducible or NC reducible to L', written L ≤_m^NC L' if there is a function f in FNC such that x ∈ L if and only if f(x) ∈ L'.

Note: From Algorithms and Theory of Computation Handbook, page 45-23, 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 Mon Feb 2 13:10:40 2015.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "NC many-one reducibility", 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/nCmanyone.html