Derandomizing polynomial identity tests means proving circuit lower bounds. (2004)

by Valentine Kabanets, Russell Impagliazzo
Venue:Computational Complexity,