Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsDan Gutfreund, Akinori Kawachi. coco 2010: 38-49 [doi] Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsBaris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi. cc, 20(2):329-366, 2011. [doi]
The following publications are possibly variants of this publication: