In complexity theory, the notion of Pcomplete decision problems is useful in the analysis of both:
Formally, a decision problem is Pcomplete (complete for the complexity class P) if it is in P and that every problem in P can be reduced to it by using an appropriate reduction.
The specific type of reduction used varies and may affect the exact set of problems. If we use NC reductions, that is, reductions which can operate in polylogarithmic time on a parallel computer with a polynomial number of processors, then all Pcomplete problems lie outside NC and so cannot be effectively parallelized, under the unproven assumption that NC ≠ P. If we use the weaker logspace reduction, this remains true, but additionally we learn that all Pcomplete problems lie outside L under the weaker unproven assumption that L ≠ P. In this latter case the set Pcomplete may be smaller.
Contents
Motivation
The class P, typically taken to consist of all the "tractable" problems for a sequential computer, contains the class NC, which consists of those problems which can be efficiently solved on a parallel computer. This is because parallel computers can be simulated on a sequential machine. It is not known whether NC = P. In other words, it is not known whether there are any tractable problems that are inherently sequential. Just as it is widely suspected that P does not equal NP, so it is widely suspected that NC does not equal P.
Similarly, the class L contains all problems that can be solved by a sequential computer in logarithmic space. Such machines run in polynomial time because they can have a polynomial number of configurations. It is suspected that L ≠ P; that is, that some problems that can be solved in polynomial time also require more than logarithmic space.
Similarly to the use of NPcomplete and Pcomplete problems to analyze the P = NP question, the Pcomplete problems, viewed as the "probably not parallelizable" or "probably inherently sequential" problems, serves in a similar manner to study the NC = P question. Finding an efficient way to parallelize the solution to some Pcomplete problem would show that NC = P. It can also be thought of as the "problems requiring superlogarithmic space"; a logspace solution to a Pcomplete problem (using the definition based on logspace reductions) would imply L = P.
The logic behind this is analogous to the logic that a polynomialtime solution to an NPcomplete problem would prove P = NP: if we have a NC reduction from any problem in P to a problem A, and an NC solution for A, then NC = P. Similarly, if we have a logspace reduction from any problem in P to a problem A, and a logspace solution for A, then L = P.
Pcomplete problems
The most basic Pcomplete problem is this: given a Turing machine, an input for that machine, and a number T (written in unary), does that machine halt on that input within the first T steps? It is clear that this problem is Pcomplete: if we can parallelize a general simulation of a sequential computer, then we will be able to parallelize any program that runs on that computer. If this problem is in NC, then so is every other problem in P. If the number of steps is written in binary, the problem is EXPTIMEcomplete.
Full article ▸
