Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

37 relations
AKS primality testArthur–Merlin protocolBQPBoolean circuit
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Face-to-face or Facebook: Can social connectedness be derived online?
Previous research has identified the importance of social connectedness in facilitating a number of positive outcomes, however… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Materializing Morality
During the past decade, the “script” concept, indicating how technologies prescribe human actions, has acquired a central place… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A Guide to Modern Econometrics
textabstractA Guide to Modern Econometrics is a new textbook published by John Wiley and Sons. It covers a wide range of topics… Expand
  • figure 2.1
  • table 2.1
  • table 2.2
  • figure 2.2
  • table 2.3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
Russell Impagliazzo* Avi Wigdersont Department of Computer Science Institute of Computer Science University of California Hebrew… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Quantum complexity theory
In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
BPP has subexponential time simulations unless EXPTIME has publishable proofs
  • L. Babai, N. Nisan
  • [] Proceedings of the Sixth Annual Structure in…
  • 1991
    • Corpus ID: 42825822
It is shown that BPP can be simulated in subexponential time for infinitely many input lengths unless exponential time collapses… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
How to recycle random bits
It is shown that modified versions of the linear congruential generator and the shift register generator are provably good for… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
A new model for weak random physical sources is presented. The new model strictly generalizes previous models (e.g., the Santha… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Complexity classes in communication complexity theory
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The complexity of approximate counting
There are several computational problems that can be formulated as problems of counting the number of objects having a certain… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE