Ausgabe 2/2011
Selected papers from the 25th Annual IEEE Conference on Computational Complexity (CCC 2010)
Inhalt (6 Artikel)
Special Issue “Conference on Computational Complexity 2010” Guest Editor’s Foreword
Dieter van Melkebeek
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
Barış Aydınlıog̃lu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi