Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

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]

Abstract

Abstract is missing.