A note on circuit lower bounds from derandomization.
Scott T. Aaronson, Dieter van Melkebeek · Electronic colloquium on computational complexity · 2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.