Definitions for BPP

This page provides all possible meanings and translations of the word BPP

Freebase

  1. 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.

Translation

Find a translation for the BPP definition in other languages:

Select another language:

Discuss these BPP definitions with the community:

Word of the Day

Would you like us to send you a FREE new word definition delivered to your inbox daily?

Please enter your email address:     


Citation

Use the citation below to add this definition to your bibliography:

Style:MLAChicagoAPA

"BPP." Definitions.net. STANDS4 LLC, 2015. Web. 3 Aug. 2015. <http://www.definitions.net/definition/BPP>.

Are we missing a good definition for BPP? Don't keep it to yourself...

Nearby & related entries:

Alternative searches for BPP:

Thanks for your vote! We truly appreciate your support.