Dan Gutfreund Akinori Kawachi Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. 146 2009 16 Electronic Colloquium on Computational Complexity (ECCC) http://eccc.hpi-web.de/report/2009/146 db/journals/eccc/eccc16.html#GutfreundK09