Dan Gutfreund, Akinori Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC2010, Cambridge, Massachusetts, June 9-12, 2010. pages 38-49, IEEE Computer Society, 2010. [doi]
Abstract is missing.