Theory of Computing ------------------- Title : On Circuit Lower Bounds from Derandomization Authors : Scott Aaronson and Dieter van Melkebeek Volume : 7 Number : 12 Pages : 177-184 URL : https://theoryofcomputing.org/articles/v007a012 Abstract -------- We present an alternate proof of the result by Kabanets and Impagliazzo (2004) 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.