Loading [MathJax]/extensions/tex2jax.js

The complexity of satisfiability problems: Refining Schaefer's theorem.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Autorschaft

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

Organisationseinheiten

Details

OriginalspracheEnglisch
Aufsatznummer4
Seiten (von - bis)245-254
Seitenumfang10
FachzeitschriftJ. Comput. Syst. Sci.
Jahrgang75
Ausgabenummer4
PublikationsstatusVeröffentlicht - 2009

Zitieren

The complexity of satisfiability problems: Refining Schaefer's theorem. / Allender, Eric; Bauland, Michael; Immerman, Neil et al.
in: J. Comput. Syst. Sci., Jahrgang 75, Nr. 4, 4, 2009, S. 245-254.

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review

Allender E, Bauland M, Immerman N, Schnoor H, Vollmer H. The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 2009;75(4):245-254. 4. doi: 10.1016/j.jcss.2008.11.001
Allender, Eric ; Bauland, Michael ; Immerman, Neil et al. / The complexity of satisfiability problems: Refining Schaefer's theorem. in: J. Comput. Syst. Sci. 2009 ; Jahrgang 75, Nr. 4. S. 245-254.
Download
@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",

}

Download

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 -

Von denselben Autoren