Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. (2004)

by V Kabanets, R Impagliazzo
Venue:Computational Complexity