77 citations · 733 across the 54 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.AI2010★ 43 cited
Hybrid tractability of soft constraint problems
Martin C. Cooper, Stanislav Zivny
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems…
cs.CC2010★ 6 cited
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
Vladimir Kolmogorov, Stanislav Zivny
We study optimisation problems that can be formulated as valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fix…
cs.CC2010★ 8 cited
The complexity of conservative finite-valued CSPs
Vladimir Kolmogorov, Stanislav Zivny
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over…