Looking for indexed pages…
P Complexity Parallel Complexity Theory may refer to:
The major complexity-theory question about whether problems solvable in polynomial time (P) can also be solved in nondeterministic polynomial time (NP).
A standard complexity class for problems solvable in polylogarithmic time using a polynomial number of processors (capturing “efficient parallel time”).
Parallel complexity studies time/processor tradeoffs under models like PRAM; “parallel complexity” depends on the chosen parallel machine model.
A line of results comparing classes and hardness notions for parallel computation, often framed via P-completeness and reducibility to NC.