20 citations · 43 across the 29 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 1 cited
Hybrid VCSPs with crisp and conservative valued templates
Rustem Takhanov
A constraint satisfaction problem (CSP) is a problem of computing a homomorphism between two relational structures. Analyzing its complexity has been…
cs.CC2015
Effectiveness of Structural Restrictions for Hybrid CSPs
Vladimir Kolmogorov, Michal Rolinek, Rustem Takhanov
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism…