Looking for indexed pages…
P Complexity may refer to:
A term used in theoretical computer science to denote a complexity measure related to problems that are solvable with polynomial resources (often in discussions about classes and runtimes).
A notation used in parallel computing to describe complexity as a function of the number of processors (often contrasted with time/“T-complexity”).