(definition)
Definition: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time. "BPP" means "Bounded error Probability in Polynomial" time.
Also known as bounded error probability in polynomial time.
See also ZPP, RP, NP, complexity class.
Note: By repeating the run, the chance of error may be arbitrarily reduced.
After [Hirv01, page 19].
Author: PEB
Scott Aaronson's Complexity Zoo
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2007.
HTML page formatted Mon Dec 17 10:40:08 2007.
Cite this as:
Paul E. Black, "BPP", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bpp.html
