Hybrid Tractable Classes of Constraint Problems
Martin Cooper, Stanislav Živný · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure-based.