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]
Abstract is missing.