Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsB. Aydinliog̃luDan Gutfreundet al.2011Computational Complexity