Classifying the Complexity of Constraints Using Finite Algebras

  title={Classifying the Complexity of Constraints Using Finite Algebras},
  author={Andrei A. Bulatov and Peter Jeavons and Andrei A. Krokhin},
  journal={SIAM J. Comput.},
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the computational complexity of the corresponding constraint satisfaction problem is connected to the… 

Figures from this paper

The complexity of soft constraint satisfaction

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.

An Algebraic Characterisation of Complexity for Valued Constraint

It is shown that the existence of a non-trivial fractional polymorphism is a necessary condition for the tractability of a valued constraint language with rational or infinite costs over any finite domain (assuming P ≠ NP).

Constraint Satisfaction Problems over Finite Structures

It is shown that every finite equationally nontrivial algebra has this property which gives, as a simple consequence, a complete complexity classification of CSPs over two-element structures, thus extending the classification for two- element relational structures by Schaefer (STOC’78).

Binarisation via Dualisation for Valued Constraints

A simple proof of the fact that to classify the computational complexity of allvalued constraint languages it suffices to classify only binary valued constraint languages.

Tractability conditions for numeric CSPs

The Complexity of Constraint Languages

An Algorithm for Constraint Satisfaction Problem

  • Dmitriy Zhuk
  • Computer Science, Mathematics
    2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)
  • 2017
An algorithm is presented 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.

Proof Complexity Meets Algebra

It is shown that, for the most studied propositional, algebraic, and semialgebraic proof systems, the classical constructions of pp-interpretability, homomorphic equivalence, and addition of constants to a core preserve the proof complexity of the CSP.

Complexity Classification in Infinite-Domain Constraint Satisfaction

This thesis studies CSPs where the variables can take values from an infinite domain, and studies the limits of complexity classification, and presents classes of computational problems provably do not exhibit a complexity dichotomy into hard and easy problems.



Constraints and universal algebra

It is shown that a constraint satisfaction problem instance can be viewed as a pair of relational structures, and the solutions to the problem are then the structure preserving mappings between these two relational structures.

Closure properties of constraints

This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition.

A dichotomy theorem for constraints on a three-element set

  • A. Bulatov
  • Computer Science
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001).

The complexity of maximal constraint languages

This paper systematically study the complexity of all maximal constraint languages, that is, languages whose expressive power is just weaker than that of the language of all constraints.

A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations

A new tractable class of constraint satisfaction problems

  • V. Dalmau
  • Mathematics, Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2005
A new class of problems called para-primal problems, incomparable with the families identified by Feder and Vardi (1998), is introduced and it is proved that any constraint problem in this class is decidable in polynomial time.

On binary constraint problems

The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski, and a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time is given.

On the Algebraic Structure of Combinatorial Problems

A Unifying Framework for Tractable Constraints

All known classes with this property may be characterized by a simple algebraic closure condition, and this condition provides a uniform test to establish whether a given set of constraints falls into any of the known tractable classes, and may therefore be solved efficiently.

Constructing Constraints

It is shown that for languages over a finite domain the concept of an 'indicator problem' gives a universal construction for any constraint within the expressive power of a language.