BPP

E2112331 UNEXPLORED

BPP (Bounded-Error Probabilistic Polynomial Time) is the class of decision problems solvable efficiently by randomized algorithms that run in polynomial time and produce the correct answer with high probability.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
BPP 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 → BPP ⓘ