BibTeX Export for Lower Bound Techniques for QBF Proof Systems

Copy to Clipboard Download

@InProceedings{mahajan:LIPIcs.STACS.2018.2,
  author =	{Mahajan, Meena},
  title =	{{Lower Bound Techniques for QBF Proof Systems}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{2:1--2:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Niedermeier, Rolf and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.2},
  URN =		{urn:nbn:de:0030-drops-85362},
  doi =		{10.4230/LIPIcs.STACS.2018.2},
  annote =	{Keywords: Proof Complexity, Quantified Boolean formulas, Resolution, Lower Bound Techniques}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode