- Authors: S. Aaronson and D. van Melkebeek.
- Reference: Theory of Computing, 7: 177-184, 2011.
- Earlier version:
Abstract
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.
