%0 Journal Article %1 journals/cc/AydinliogluGHK11 %A Aydinlioglu, Baris %A Gutfreund, Dan %A Hitchcock, John M. %A Kawachi, Akinori %D 2011 %J Comput. Complex. %K dblp %N 2 %P 329-366 %T Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. %U http://dblp.uni-trier.de/db/journals/cc/cc20.html#AydinliogluGHK11 %V 20

@article{journals/cc/AydinliogluGHK11, added-at = {2024-05-07T00:00:00.000+0200}, author = {Aydinlioglu, Baris and Gutfreund, Dan and Hitchcock, John M. and Kawachi, Akinori}, biburl = {https://www.bibsonomy.org/bibtex/2e6be7ffb2c10cd9747f58e335c1abf86/dblp}, ee = {https://doi.org/10.1007/s00037-011-0010-8}, interhash = {824e43f6afb35100cae9a856bbc39bc6}, intrahash = {e6be7ffb2c10cd9747f58e335c1abf86}, journal = {Comput. Complex.}, keywords = {dblp}, number = 2, pages = {329-366}, timestamp = {2024-05-13T07:15:04.000+0200}, title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.}, url = {http://dblp.uni-trier.de/db/journals/cc/cc20.html#AydinliogluGHK11}, volume = 20, year = 2011 }