Details
| Original language | English |
|---|---|
| Article number | 4 |
| Pages (from-to) | 245-254 |
| Number of pages | 10 |
| Journal | J. Comput. Syst. Sci. |
| Volume | 75 |
| Issue number | 4 |
| Publication status | Published - 2009 |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: J. Comput. Syst. Sci., Vol. 75, No. 4, 4, 2009, p. 245-254.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - The complexity of satisfiability problems: Refining Schaefer's theorem.
AU - Allender, Eric
AU - Bauland, Michael
AU - Immerman, Neil
AU - Schnoor, Henning
AU - Vollmer, Heribert
N1 - 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).
PY - 2009
Y1 - 2009
U2 - 10.1016/j.jcss.2008.11.001
DO - 10.1016/j.jcss.2008.11.001
M3 - Article
VL - 75
SP - 245
EP - 254
JO - J. Comput. Syst. Sci.
JF - J. Comput. Syst. Sci.
SN - 0022-0000
IS - 4
M1 - 4
ER -