Bounded-Error Probabilistic Polynomial Time

E1752142 UNEXPLORED

Bounded-Error Probabilistic Polynomial Time (BPP) is a complexity class consisting of decision problems that can be efficiently solved by randomized algorithms with a guaranteed low probability of error.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Bounded-Error Probabilistic Polynomial Time canonical	2

Referenced by (2)

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

BPP → fullName → Bounded-Error Probabilistic Polynomial Time ⓘ

subject linked to: complexity class BPP

BPP → abbreviationFor → Bounded-Error Probabilistic Polynomial Time ⓘ

subject linked to: complexity class BPP