77 citations · 733 across the 54 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 74 cited
The power of linear programming for general-valued CSPs
Vladimir Kolmogorov, Johan Thapper, Stanislav Zivny
Let , called the domain, be a fixed finite set and let , called the valued constraint language, be a fixed set of functions of the form , wh…
cs.AI2013★ 2 cited
Tractable Combinations of Global Constraints
David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen +1
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a par…