# BPP (complexity)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Studies in Complexity and Cryptography
- 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

- 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

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

1993

Highly Cited

1993

- computational complexity
- 1993

We show thatBPP can be simulated in subexponential time for infinitely many input lengths unless exponential time â„´ collapses toâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- FOCS
- 1991

We show how to simulate BPP and approximation algorithms in polynomial time using the output from a Î´-source. A Î´-source is aâ€¦Â (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

- Inf. Process. Lett.
- 1983

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

- STOC
- 1983

There are several computational problems that can be formulated as problems of counting the number of objects having a certainâ€¦Â (More)

Is this relevant?