Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity, 20(2):329-366, 2011. [doi]
@article{AydinliogluGHK11,
title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds},
author = {Baris Aydinlioglu and Dan Gutfreund and John M. Hitchcock and Akinori Kawachi},
year = {2011},
doi = {10.1007/s00037-011-0010-8},
url = {http://dx.doi.org/10.1007/s00037-011-0010-8},
researchr = {https://researchr.org/publication/AydinliogluGHK11},
cites = {0},
citedby = {0},
journal = {Computational Complexity},
volume = {20},
number = {2},
pages = {329-366},
}