The Parameterized Complexity of Local Consistency

  title={The Parameterized Complexity of Local Consistency},
  author={Serge Gaspers and Stefan Szeider},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
We investigate the parameterized complexity of deciding whether a constraint network is kconsistent. We show that, parameterized by k, the problem is complete for the complexity class co-W[2]. As secondary parameters we consider the maximum domain size d and the maximum number ` of constraints in which a variable occurs. We show that parameterized by k + d, the problem drops down one complexity level and becomes co-W[1]-complete. Parameterized by k + d + ` the problem drops down one more level… CONTINUE READING


Publications citing this paper.
Showing 1-6 of 6 extracted citations

Lower Bounds for Existential Pebble Games and k-Consistency Tests

2012 27th Annual IEEE Symposium on Logic in Computer Science • 2012
View 4 Excerpts
Highly Influenced

Small Unsatisfiable Subsets in Constraint Satisfaction

2014 IEEE 26th International Conference on Tools with Artificial Intelligence • 2014

Capturing structure in hard combinatorial problems

2013 IEEE 25th International Conference on Tools with Artificial Intelligence • 2013
View 1 Excerpt


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

Constraint Propagation

Handbook of Constraint Programming • 2006
View 8 Excerpts
Highly Influenced

The Turing way to parameterized complexity

J. Comput. Syst. Sci. • 2003
View 4 Excerpts
Highly Influenced

Fixed Parameter Tractability and Completeness

Complexity Theory: Current Research • 1992
View 7 Excerpts
Highly Influenced

Parameterized Complexity Theory

Texts in Theoretical Computer Science. An EATCS Series • 2006
View 4 Excerpts
Highly Influenced

Mackworth . Consistency in networks of relations

K. A.
Artificial Intelligence • 2011

Similar Papers

Loading similar papers…