%0 Conference Paper %1 conf/coco/GutfreundK10 %A Gutfreund, Dan %A Kawachi, Akinori %B CCC %D 2010 %I IEEE Computer Society %K dblp %P 38-49 %T Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. %U http://dblp.uni-trier.de/db/conf/coco/coco2010.html#GutfreundK10 %@ 978-0-7695-4060-3

@inproceedings{conf/coco/GutfreundK10, added-at = {2023-03-24T00:00:00.000+0100}, author = {Gutfreund, Dan and Kawachi, Akinori}, biburl = {https://www.bibsonomy.org/bibtex/249bf68550d044a8f723f2cc28868791d/dblp}, booktitle = {CCC}, crossref = {conf/coco/2010}, ee = {https://doi.ieeecomputersociety.org/10.1109/CCC.2010.13}, interhash = {dec17e6c05b8e006b80f28ba40187d49}, intrahash = {49bf68550d044a8f723f2cc28868791d}, isbn = {978-0-7695-4060-3}, keywords = {dblp}, pages = {38-49}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T01:31:20.000+0200}, title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.}, url = {http://dblp.uni-trier.de/db/conf/coco/coco2010.html#GutfreundK10}, year = 2010 }