BibTeX record journals/toct/Chen17

download as .bib file

@article{DBLP:journals/toct/Chen17,
  author       = {Hubie Chen},
  title        = {Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation
                  as a Source of Hardness},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {9},
  number       = {3},
  pages        = {15:1--15:20},
  year         = {2017},
  url          = {https://doi.org/10.1145/3087534},
  doi          = {10.1145/3087534},
  timestamp    = {Mon, 08 Jun 2020 22:18:54 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Chen17.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.