Explore relationships

P-complete

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.

Use + to expand a branch. Click a topic name to open its summary.