A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games

Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek. A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electronic Colloquium on Computational Complexity (ECCC), 17:174, 2010. [doi]

Abstract

Abstract is missing.