On the Computational Complexity of Monotone Constraint Satisfaction Problems

  title={On the Computational Complexity of Monotone Constraint Satisfaction Problems},
  author={Miki Hermann and Florian Richoux},
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NPcomplete, but its complexity depends on a parameter, usually a set of relations, upon which they are constructed. Following the parameter, there exist tractable and intractable instances of CSPs. In this paper we show a dichotomy theorem for every finite domain of CSP including also disjunctions. This dichotomy condition is based on a simple condition… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 10 references

Composition sequences for functions over a finite domain

Theor. Comput. Sci. • 2003
View 6 Excerpts
Highly Influenced

On the Algebraic Structure of Combinatorial Problems

Theor. Comput. Sci. • 1998
View 4 Excerpts
Highly Influenced

The complexity of satisfiability problems

T. J. Schaefer
In Proceedings 10th Symposium on Theory of Computing (STOC’78), San Diego (California, USA), pages 216–226, • 1978
View 3 Excerpts
Highly Influenced

Galois connections for operations and relations

R. Pöschel
In K. Denecke et al, editors, Galois Connections and Applications, pages 231–258. Kluwer, • 2004
View 3 Excerpts

Parameterized Complexity

Monographs in Computer Science • 1999
View 1 Excerpt

On the existence of k-valued closed classes that have no bases

Yu. I. Yanov, A. A. Muchnik
Doklady Akademii Nauk SSSR, • 1959
View 1 Excerpt

Une généralisation de la notion de corps

M. Krasner
Journal de Mathématiques pures et appliquées, 17:367–385, • 1938
View 1 Excerpt

Similar Papers

Loading similar papers…