BibTeX record journals/jcss/AllenderBISV09

download as .bib file

@article{DBLP:journals/jcss/AllenderBISV09,
  author       = {Eric Allender and
                  Michael Bauland and
                  Neil Immerman and
                  Henning Schnoor and
                  Heribert Vollmer},
  title        = {The complexity of satisfiability problems: Refining Schaefer's theorem},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {75},
  number       = {4},
  pages        = {245--254},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jcss.2008.11.001},
  doi          = {10.1016/J.JCSS.2008.11.001},
  timestamp    = {Tue, 16 Feb 2021 14:04:44 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/AllenderBISV09.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.