A note on circuit lower bounds from derandomization

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.

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Scott Aaronson, Dieter van Melkebeek
• Keywords: Alternate Proof, Circuit Lower Bounds, ECCC 2010, Polynomial Identity