BibTeX record journals/cc/AydinliogluGHK11

download as .bib file

@article{DBLP:journals/cc/AydinliogluGHK11,
  author       = {Baris Aydinlioglu and
                  Dan Gutfreund and
                  John M. Hitchcock and
                  Akinori Kawachi},
  title        = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies
                  Exponential-Size Lower Bounds},
  journal      = {Comput. Complex.},
  volume       = {20},
  number       = {2},
  pages        = {329--366},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00037-011-0010-8},
  doi          = {10.1007/S00037-011-0010-8},
  timestamp    = {Sun, 15 Mar 2020 19:46:52 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AydinliogluGHK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.