The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer

Browse the full MFCS paper archive.