BibTeX record conf/focs/PichS19

download as .bib file

@inproceedings{DBLP:conf/focs/PichS19,
  author       = {J{\'{a}}n Pich and
                  Rahul Santhanam},
  editor       = {David Zuckerman},
  title        = {Why are Proof Complexity Lower Bounds Hard?},
  booktitle    = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2019, Baltimore, Maryland, USA, November 9-12, 2019},
  pages        = {1305--1324},
  publisher    = {{IEEE} Computer Society},
  year         = {2019},
  url          = {https://doi.org/10.1109/FOCS.2019.00080},
  doi          = {10.1109/FOCS.2019.00080},
  timestamp    = {Sun, 25 Oct 2020 22:43:31 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PichS19.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.