Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nonserial Dynamic Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraint Processing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The complexity of soft constraint satisfaction
Artificial Intelligence
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Hybrid tractability of valued constraint problems
Artificial Intelligence
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Parameterized Complexity
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We study the computational complexity of binary valued constraint satisfaction problems (VCSP) given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables.We show that for several computational problems, including CSP, Max-CSP, finite-valued VCSP, and general-valued VCSP, the only non-trivial tractable classes are the well known maximum matching problem and the recently discovered joint-winner property [9].