Looking for indexed pages…
P Complexity may refer to:
The major question in computational complexity about whether problems in the class P can be solved in polynomial time also belong to NP.
A term used in some program-analysis or automated-program-transformations contexts to describe a complexity measure parameterized by a letter “p” (exact meaning depends on the specific paper/tool).