A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
From local to global consistency
Artificial Intelligence
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Synthesizing constraint expressions
Communications of the ACM
Communications of the ACM
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraint Processing
The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
File searching using variable length keys
IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
Parameterized approximation problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity
Lower Bounds for Existential Pebble Games and k-Consistency Tests
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.00 |
We investigate the parameterized complexity of deciding whether a constraint network is k-consistent. 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 l 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+l the problem drops down one more level and becomes fixed-parameter tractable. We further show that the same complexity classification applies to strong k-consistency, directional k-consistency, and strong directional k-consistency. Our results establish a super-polynomial separation between input size and time complexity. Thus we strengthen the known lower bounds on time complexity of k-consistency that are based on input size.