Dan Gutfreund, Akinori Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), 16:146, 2009. [doi]
@article{GutfreundK09,
title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds},
author = {Dan Gutfreund and Akinori Kawachi},
year = {2009},
url = {http://eccc.hpi-web.de/report/2009/146},
researchr = {https://researchr.org/publication/GutfreundK09},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {16},
pages = {146},
}