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]
@article{AaronsonABHM10,
title = {A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games},
author = {Scott Aaronson and Baris Aydinlioglu and Harry Buhrman and John M. Hitchcock and Dieter van Melkebeek},
year = {2010},
url = {http://eccc.hpi-web.de/report/2010/174},
researchr = {https://researchr.org/publication/AaronsonABHM10},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {17},
pages = {174},
}