Affiliation:
1. Universitat Pompeu Fabra, Barcelona, Spain
Abstract
An emerging area of research studies the complexity of constraint satisfaction problems under restricted constraint languages. This article gives a self-contained, contemporary presentation of Schaefer's theorem on Boolean constraint satisfaction, the inaugural result of this area, as well as analogs of this theorem for quantified formulas. Our exposition makes use of and may serve as an introduction to logical and algebraic tools that have recently come into focus.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference58 articles.
1. The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem
2. A linear-time algorithm for testing the truth of certain quantified boolean formulas
3. On Digraph Coloring Problems and Treewidth Duality
4. Bauland M. Böhler E. Creignou N. Reith S. Schnoor H. and Vollmer H. 2005. Quantified constraints: The complexity of decision and counting for bounded alternation. ECCC Tech. rep. TR05-24. http://eccc.uni-trier.de/zear/2005. Bauland M. Böhler E. Creignou N. Reith S. Schnoor H. and Vollmer H. 2005. Quantified constraints: The complexity of decision and counting for bounded alternation. ECCC Tech. rep. TR05-24. http://eccc.uni-trier.de/zear/2005.
5. The Core of a Countably Categorical Structure
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献