Skip to main content

computational complexity

Ausgabe 2/2011

Selected papers from the 25th Annual IEEE Conference on Computational Complexity (CCC 2010)

Inhalt (6 Artikel)

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

Barış Aydınlıog̃lu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi