Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. The Complexity of Satisfiability Problems: Refining Schaefer s Theorem. In Joanna Jedrzejowicz, Andrzej Szepietowski, editors, Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings. Volume 3618 of Lecture Notes in Computer Science, pages 71-82, Springer, 2005. [doi]
@inproceedings{AllenderBISV05,
title = {The Complexity of Satisfiability Problems: Refining Schaefer s Theorem},
author = {Eric Allender and Michael Bauland and Neil Immerman and Henning Schnoor and Heribert Vollmer},
year = {2005},
doi = {10.1007/11549345_8},
url = {http://dx.doi.org/10.1007/11549345_8},
researchr = {https://researchr.org/publication/AllenderBISV05},
cites = {0},
citedby = {0},
pages = {71-82},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings},
editor = {Joanna Jedrzejowicz and Andrzej Szepietowski},
volume = {3618},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-28702-7},
}