[IEEE 2010 IEEE 25th Annual Conference on Computational...

  • Main
  • [IEEE 2010 IEEE 25th Annual Conference...

[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, Akinori
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Year:
2010
Language:
english
DOI:
10.1109/ccc.2010.13
File:
PDF, 384 KB
english, 2010
Conversion to is in progress
Conversion to is failed