BibTeX record conf/mfcs/AllenderBISV05

• > Home > conf/mfcs/AllenderBISV05

@inproceedings{DBLP:conf/mfcs/AllenderBISV05,
  author       = {Eric Allender and
                  Michael Bauland and
                  Neil Immerman and
                  Henning Schnoor and
                  Heribert Vollmer},
  editor       = {Joanna Jedrzejowicz and
                  Andrzej Szepietowski},
  title        = {The Complexity of Satisfiability Problems: Refining Schaefer's Theorem},
  booktitle    = {Mathematical Foundations of Computer Science 2005, 30th International
                  Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3618},
  pages        = {71--82},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11549345\_8},
  doi          = {10.1007/11549345\_8},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AllenderBISV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}