<p>Check Chapter 7 of Salil Vadhan's <a href="http://people.seas.harvard.edu/~salil/pseudorandomness/pseudorandomness-Aug12.pdf">monograph</a>. Corollary 7.64 is Impagliazzo and Wigderson's result.</p>

CC BY-SA 3.0
2013-10-06T14:56:00.473Z
2013-10-06T14:56:00.473Z
Sasho Nikolov
<p>I'm reading Impagliazzo and Wigderson's famous $\mathsf P=\mathsf{BPP}$ paper in 1997.  Since I'm new to this field and the paper is a concise conference version, I have difficulty following their proofs.  In particular, some of their new theorems lack proofs.  To my best knowledge there hasn't been a journal version published.</p>

<p>I'm looking for resources from which I can learn their result, preferably those with formal proofs.  I'd be very grateful if you could tell me about such resources.</p>

<cc.complexity-theory><reference-request><circuit-complexity><derandomization><pseudorandom-generators>
Impagliazzo and Wigderson's famous P=BPP paper
Pteromys
# Impagliazzo and Wigderson's famous P=BPP paper

(Asked by: username_0 on 2013-10-06)

I'm reading Impagliazzo and Wigderson's famous $\mathsf P=\mathsf{BPP}$ paper in 1997. Since I'm new to this field and the paper is a concise conference version, I have difficulty following their proofs. In particular, some of their new theorems lack proofs. To my best knowledge there hasn't been a journal version published.

I'm looking for resources from which I can learn their result, preferably those with formal proofs. I'd be very grateful if you could tell me about such resources.

**Tags:** cc.complexity-theory, reference-request, circuit-complexity, derandomization, pseudorandom-generators


---

## 1 answers

### Answer by username_1 on 2013-10-06. Score: 17 | Accepted answer

Check Chapter 7 of Salil Vadhan's [monograph](http://people.seas.harvard.edu/~salil/pseudorandomness/pseudorandomness-Aug12.pdf). Corollary 7.64 is Impagliazzo and Wigderson's result.


---

