Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,123,617 papers from all fields of science
Search
Sign In
Create Free Account
BPP (complexity)
Known as:
P = BPP problem
, Bounded error probability in polynomial time
, BPP (complexity class)
Expand
In computational complexity theory, BPP, which stands for bounded-error probabilistic polynomial time is the class of decision problems solvable by a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
37 relations
AKS primality test
Arthur–Merlin protocol
BQP
Boolean circuit
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Performance Evaluation of Gray Scale Image using EZW and SPIHT Coding Schemes
P. Rawat
,
A. Nautiyal
,
Swati Chamoli
2015
Corpus ID: 3331810
Digital wavelet transform based compression methods have higher compression rate with less amount of memory requirements…
Expand
2009
2009
A novel rate control initialization algorithm for H.264
Wei Wu
,
Hae-Kwang Kim
IEEE transactions on consumer electronics
2009
Corpus ID: 30353738
This paper presents a novel rate control initialization algorithm for H.264. Firstly the first instantaneous decoding refresh…
Expand
2007
2007
BUSINESS PROCESSES ARCHITECTURE AND DESIGN
O. Barros
2007
Corpus ID: 9174951
The problem of interest to us is how to design such structure, with a particular approach in mind: to start with a general…
Expand
2006
2006
Will You Die with Me?: My Life and the Black Panther Party
F. Forbes
,
Elaine Brown
2006
Corpus ID: 191037356
Amid the social turmoil of the 1960s and,70s, a young man in California found his purpose in the rise of the Black Panther Party…
Expand
2005
2005
Direct and indirect methods for packet loss approximation in buffered systems
A. Gulyás
,
J. Bíró
Next Generation Internet Networks,
2005
Corpus ID: 16129190
The workload loss ratio (WLR) is a key parameter from the point of quality of service (QoS) provisioning in packet switched…
Expand
2003
2003
Deciding Bisimilarity between BPA and BPP Processes
P. Jančar
,
A. Kucera
,
F. Moller
International Conference on Concurrency Theory
2003
Corpus ID: 13867292
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective…
Expand
1999
1999
Complexity theoretical results for randomized branching programs
Martin Sauerhoff
1999
Corpus ID: 12511056
This work is settled in the area of complexity theory for rest icted variants of branching programs. Today, branching programs…
Expand
1997
1997
On Nondeterminism versus Randomness for Read-Once Branching Programs
Martin Sauerhoff
Electron. Colloquium Comput. Complex.
1997
Corpus ID: 16709840
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing…
Expand
1996
1996
Symmetries and Black Holes in 2D Dilaton Gravity
J. Cruz
,
J. Navarro-Salas
,
M. Navarro
,
C. F. Talavera
1996
Corpus ID: 14712011
We study global symmetries of generic 2D dilaton gravity models. Using a non-linear sigma model formulation we show that the…
Expand
Highly Cited
1994
Highly Cited
1994
CONDUCTING PSEUDOPOLYROTAXANES : A CHEMORESISTIVE RESPONSE VIA MOLECULAR RECOGNITION
M. Marsella
,
P. Carroll
,
T. Swager
1994
Corpus ID: 98088392
Pseudorotaxanes are host-guest systems comprised of a cyclic molecule whose cavity is pierced by a compatible linear molecule. In…
Expand