On the Computational Complexity of Monotone Constraint Satisfaction Problems
Constraint Satisfaction Problems (csp) constitute a convenient way to capture many combinatorial problems. The general csp is known to be NP-complete, 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, allowing us to classify monotone csps as tractable or NP-complete. We also prove that the meta-problem, verifying the tractability condition for monotone constraint satisfaction problems, is fixed-parameter tractable. Moreover, we present a polynomial-time algorithm to answer this question for monotone csps over ternary domains.
KeywordsComputational Complexity Constant Function Unary Function Domain Size Constraint Satisfaction Problem
Unable to display preview. Download preview PDF.
- 9.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing (STOC 1978), San Diego, California, USA, pp. 216–226 (1978)Google Scholar