![](/img/cover-not-exists.png)
[IEEE 2010 IEEE 25th Annual Conference on Computational Complexity (CCC) - Cambridge, MA, USA (2010.06.9-2010.06.12)] 2010 IEEE 25th Annual Conference on Computational Complexity - Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
Gutfreund, Dan, Kawachi, AkinoriYear:
2010
Language:
english
DOI:
10.1109/ccc.2010.13
File:
PDF, 384 KB
english, 2010