P-complete

(definition)

Definition: A language L is P-hard under NC many-one reducibility if L' ≤_m^NC for every L' ∈ P. A language L is P-complete under NC reducibility if L ∈ P and L is P-hard.

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 Wed Mar 13 12:42:46 2019.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "P-complete", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/pcomplete.html