Looking for indexed pages…
P Complexity Parallel Complexity may refer to:
A complexity-theory concept that measures the minimum time (often as a function of input size and number of processors) needed by parallel algorithms/models.
The complexity class of decision problems solvable in polynomial time on a deterministic single-processor machine.