# 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

1983-2017

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
• computational complexity
• 2002
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
• FOCS
• 2002
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using Õ(log n) rounds of interaction… (More)
Is this relevant?
1998
1998
• computational complexity
• 1998
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
• STOC
• 1997
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
• 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
• STOC
• 1993
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
• 27th Annual Symposium on Foundations of Computer…
• 1986
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