Explore relationships

PP (complexity)

In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time.

Use + to expand a branch. Click a topic name to open its summary.