• Corpus ID: 28271359

The Constraint Satisfaction Problem: Complexity and Approximability

  title={The Constraint Satisfaction Problem: Complexity and Approximability},
  author={A. S. Fraser and Andrei A. Krokhin},
  booktitle={The Constraint Satisfaction Problem},
Constraint satisfaction has always played a central role in computational complexity theory; appropriate versions of CSPs are classical complete problems for most standard complexity classes. CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena. For instance, they help to understand which mathematical properties make a computational problem tractable (in a wide sense, e.g., polynomial-time solvable, non… 

Figures from this paper

Algebraic approach to promise constraint satisfaction
A new class of problems that can be viewed as algebraic versions of the (Gap) Label Cover problem are introduced, and it is shown that every PCSP with a fixed constraint language is equivalent to a problem of this form.
A Proof of the CSP Dichotomy Conjecture
This article presents an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
Fine-Grained Time Complexity of Constraint Satisfaction Problems
Under the exponential-time hypothesis (ETH), the existence of subexponential algorithms for finite-domain NP-complete CSPΓ problems is ruled out and a relation SD is identified such that the time complexity of the NP- complete CSP({SD}) is a lower bound for all NP- Complete CSPs of this kind.
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps
  • L. Barto
  • Mathematics, Computer Science
  • 2019
This paper explains an extension of this theory to a much broader class of computational problems, the promise CSPs, which includes relaxed versions of C SPs such as the problem of finding a 137-coloring of a 3-colorable graph.
The Complexity of the Distributed Constraint Satisfaction Problem
The results endorse the well-known fact from classical CSPs that the complexity of fixed-template computational problems depends on the template's invariance under certain operations, and show that DCSP is polynomial-time tractable if and only if $\Gamma$ is invariant under symmetric polymorphisms of all arities.
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
This work finds the first example of an NP-complete SAT problem with a non-trivial algorithm which also admits aNon-Trivial lower bound under SETH, and suggests a dichotomy conjecture with a close connection to the CSP dichotomy theorem.
On the complexity of CSP-based ideal membership problems
A variation of the IMP is introduced and a unified framework, different from the celebrated Buchberger’s algorithm, is proposed to construct a bounded degree Gröbner Basis for many combinatorial problems.
A dichotomy theorem for nonuniform CSPs simplified
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language G the problem CSP(G) is either solvable in polynomial time or is NP-complete.
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
The theory initiated in this paper will eventually result in a simple and more natural proof of the Dichotomy Theorem that employs a simpler and more efficient algorithm, and will help in attacking complexity questions in other CSP-related problems.
A Dichotomy Theorem for Nonuniform CSPs
  • A. Bulatov
  • Mathematics
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP is either solvable in polynomial time or is NP-complete.


Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
This article addresses the general limit of the mentioned tractability results for CSP and #CSP, that they only apply to instances where all constraints belong to a single tractable language (in general, the union of two tractable languages is not tractable).
Complexity of conservative constraint satisfaction problems
This work completely characterize conservative constraint languages that give rise to polynomial time solvable CSP classes, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is solvable in polynometric time.
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al.
Towards a dichotomy theorem for the counting constraint satisfaction problem
  • A. Bulatov, V. Dalmau
  • Mathematics, Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
It is proved that if a subclass of the #CSP is tractable, then constraints allowed by the class satisfy some very restrictive condition: it has to have a Mal'tsev polymorphism, that is a ternary operation m(x, y, z) such that x = x.
The tractability of CSP classes defined by forbidden patterns
This work describes the theoretical framework which can be used to reason about classes of problems defined by forbidden patterns and shows that this framework generalises certain known hybrid tractable classes.
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the
The complexity and expressive power of valued constraints
A novel class of sub modular functions of arbitrary arities that can be expressed by binary submodular functions, and therefore minimised efficiently using a so-called expressibility reduction to the (s,t)-Min-Cut problem is identified.
Asking the Metaquestions in Constraint Tractability
This article systematically studies—for various classes of polymorphisms—the computational complexity of deciding whether or not a given structure ℍ admits a polymorphism from the class, and proves the NP-completeness of deciding a condition conjectured to characterize the tractable problems CSP(ℍ).