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

Dan Gutfreund, Akinori Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC), 16:146, 2009. [doi]

Abstract

Abstract is missing.