35 search results - page 1 / 7 » CD(4) has bounded width |
41
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
AAAI
2012
13 years 4 days ago
2012
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...