BibTeX record journals/eccc/ECCC-TR04-100

download as .bib file

@article{DBLP:journals/eccc/ECCC-TR04-100,
  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      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-100}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-100/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-100},
  timestamp    = {Wed, 28 Sep 2022 15:27:24 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-100.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics