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,
which problems are difficult to solve in limited space.

Extract the main themes as json 