# What does **BPP** mean in **Networking**?

## This page is about the meanings of the acronym/abbreviation/shorthand **BPP** in the **Computing** field in general and in the **Networking** terminology in particular.

# Translation

#### Find a translation for **BPP** in other languages:

Select another language:

# Definition

#### What does **BPP** mean?

- BPP
- In computational complexity theory, BPP, which stands for bounded-error probabilistic polynomial time is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of at most 1/3 for all instances. Informally, a problem is in BPP if there is an algorithm for it that has the following properties: It is allowed to flip coins and make random decisions It is guaranteed to run in polynomial time On any given run of the algorithm, it has a probability of at most 1/3 of giving the wrong answer, whether the answer is YES or NO.

# Embed

#### Discuss this BPP abbreviation with the community:

# Citation

#### Use the citation below to add this abbreviation to your bibliography:

"BPP." *Abbreviations.com.* STANDS4 LLC, 2016. Web. 29 May 2016. <http://www.abbreviations.com/term/62688>.