Looking for indexed pages…
P Complexity Parallel Complexity may refer to:
Theoretical computer science measures of how efficiently problems can be solved using parallel computation over some number of processors (often denoted with parameters like p and P).
A notation used in the study of parallel algorithms to describe complexity growth as a function of processor count p (e.g., time/space tradeoffs depending on p).
In complexity theory, the class P consists of decision problems solvable in polynomial time on a single (sequential) machine; sometimes contrasted with parallel complexity notions.