PP

E2112330 UNEXPLORED

PP is a probabilistic complexity class consisting of decision problems solvable by a polynomial-time Turing machine that accepts with probability greater than 1/2.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
PP canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

BQP vs. the Polynomial Hierarchy → concernsClass → PP ⓘ