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]

Authors

Dan Gutfreund

This author has not been identified. Look up 'Dan Gutfreund' in Google

Akinori Kawachi

This author has not been identified. Look up 'Akinori Kawachi' in Google