BibTeX record conf/stacs/BeyersdorffCJ15

download as .bib file

@inproceedings{DBLP:conf/stacs/BeyersdorffCJ15,
  author       = {Olaf Beyersdorff and
                  Leroy Chew and
                  Mikol{\'{a}}s Janota},
  editor       = {Ernst W. Mayr and
                  Nicolas Ollinger},
  title        = {Proof Complexity of Resolution-based {QBF} Calculi},
  booktitle    = {32nd International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2015, March 4-7, 2015, Garching, Germany},
  series       = {LIPIcs},
  volume       = {30},
  pages        = {76--89},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2015.76},
  doi          = {10.4230/LIPICS.STACS.2015.76},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BeyersdorffCJ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.