The complexity of satisfiability problems: Refining Schaefer's theorem☆
Under an Elsevier user license
open archive
Keywords
Computational complexity
Constraint satisfaction problem
Propositional satisfiability
Clone theory
Cited by (0)
- ☆
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.
Copyright © 2008 Elsevier Inc. All rights reserved.