@article{2e43e3a088d74b1e989e8614ec0901c5,
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",
note = "Funding information: ? Supported in part by DFG Grants Vo 630/5-1/2, Vo 630/6-1, and NSF Grants CCF-0514155, DMS-0652582, CCF-0830133, CCF-0832787, and CCF-0514621. * Corresponding author. Fax: +49 511 762 19606. E-mail addresses: allender@cs.rutgers.edu (E. Allender), bauland@thi.uni-hannover.de (M. Bauland), immerman@cs.umass.edu (N. Immerman), schnoor@ti.informatik.uni-kiel.de (H. Schnoor), vollmer@thi.uni-hannover.de (H. Vollmer).",
year = "2009",
doi = "10.1016/j.jcss.2008.11.001",
language = "English",
volume = "75",
pages = "245--254",
journal = "J. Comput. Syst. Sci.",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "4",
}
