P-complete
Sign in to saveIn computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction.
~10 min read
Encyclopedic overview
6 sectionsContents
- Motivation
- Reductions
- P-complete
- '''P'''-complete problems
- Notes
- References
In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction.
The notion of P-complete decision problems is useful in the analysis of which problems are difficult to parallelize effectively and which problems are difficult to solve in limited space, specifically when stronger notions of reducibility than polytime-reducibility are considered.
Excerpted from Wikipedia’s “P-complete” article, available under the CC BY-SA 4.0 licence.