FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
010203019832017

Related topics

Related topics

37 relations
AKS primality testArthur–Merlin protocolBQPBoolean circuit
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
BPP (complexity)
Time complexity
Computational complexity theory
NP (complexity)
Randomized algorithm
Decision problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In a World of P=BPP
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity assumption on… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using Õ(log n) rounds of interaction… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
1998
1998
Symmetric alternation captures BPP
We introduce the natural class ${\bf\,S}^P_2$ containing those languages that may be expressed in terms of two symmetric… (More)
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… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Simulating BPP Using a General Weak Random Source
  • David Zuckermany
  • 1996
We show how to simulate BPP and approximation algorithms in polynomial time using the output from a-source. A-source is a weak… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an… (More)
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… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
BPP and the Polynomial Hierarchy
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The Complexity of Approximate Counting (Preliminary Version)
There are several computational problems that can be formulated as problems of counting the number of objects having a certain… (More)
Is this relevant?