Publications

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

• • B. Aydinliog̃lu
  • Dan Gutfreund
  • et al.
• 2011
• Computational Complexity