Skip to search formSkip to main contentSkip to account menu

BPP (complexity)

Known as: P = BPP problem, Bounded error probability in polynomial time, BPP (complexity class) 
In computational complexity theory, BPP, which stands for bounded-error probabilistic polynomial time is the class of decision problems solvable by a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

37 relations
AKS primality testArthur–Merlin protocolBQPBoolean circuit

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Iris image compression using wavelets transform coding
Iris recognition system for identity authentication and verification is one of the most precise and accepted biometrics in the… 
Highly Cited
2012
Highly Cited
2012
Direct diode lasers with comparable beam quality to fiber, CO2, and solid state lasers
TeraDiode has produced kW-class ultra-high brightness fiber-coupled direct diode lasers. A fiber-coupled direct diode laser with… 
Highly Cited
2008
Highly Cited
2008
Modelling of state-dependent multirate systems carrying BPP traffic
This paper presents a simple approximate calculation methodology of the occupancy distribution and the blocking probability in… 
2007
2007
Modelling work distribution mechanisms using Colored Petri Nets
Workflow management systems support business processes and are driven by their models. These models cover different perspectives… 
1998
1998
The Analytic Polynomial‐Time Hierarchy
Motivated by results on interactive proof systems we investigate an ∃‐∀hierarchy over P using word quantifiers as well as two… 
Highly Cited
1997
Highly Cited
1997
Phone classification with segmental features and a binary-pair partitioned neural network classifier
This paper presents methods and experimental results for phonetic classification using 39 phone classes and the NIST recommended… 
1996
1996
Hitting Sets Derandomize BPP
We show that hitting sets can derandomize any probabilistic, two-sided error algorithm. This gives a positive answer to a… 
Highly Cited
1994
Highly Cited
1994
CONDUCTING PSEUDOPOLYROTAXANES : A CHEMORESISTIVE RESPONSE VIA MOLECULAR RECOGNITION
Pseudorotaxanes are host-guest systems comprised of a cyclic molecule whose cavity is pierced by a compatible linear molecule. In… 
Highly Cited
1986
Highly Cited
1986
Randomness, Relativizations, and Polynomial Reducibilities
We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has… 
Highly Cited
1974
Highly Cited
1974
Candidate hormones of the gut. VI. Bovine pancreatic polypeptide (BPP) and avian pancreatic polypeptide (APP).
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)