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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Digital wavelet transform based compression methods have higher compression rate with less amount of memory requirements… 
2015
2015
A total of 230 children having bronchopulmonary pathology (BPP) were examined. Patients were divided into 4 groups according to… 
2015
2015
This essay examines the complex gender relations in the Black Panther Party (BPP). At the outset, hypermasculine ideals drove the… 
2009
2009
This paper presents a novel rate control initialization algorithm for H.264. Firstly the first instantaneous decoding refresh… 
2009
2009
. We consider the feasibility problem OPP in higher-dimensional orthogonal packing: given a set of d -dimensional ( d ≥ 2… 
2007
2007
The problem of interest to us is how to design such structure, with a particular approach in mind: to start with a general… 
2006
2006
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… 
2003
2003
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective… 
1996
1996
We study global symmetries of generic 2D dilaton gravity models. Using a non-linear sigma model formulation we show that the… 
Highly Cited
1994
Highly Cited
1994
Pseudorotaxanes are host-guest systems comprised of a cyclic molecule whose cavity is pierced by a compatible linear molecule. In…