Effectiveness of Structural Restrictions for Hybrid CSPs

  title={Effectiveness of Structural Restrictions for Hybrid CSPs},
  author={V. Kolmogorov and Michal Rolinek and 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 $\mbox{$\bR \rightarrow \bGamma$}$ between two relational structures, e.g.\ between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for {\em fixed template CSPs} in which the right side $\bGamma$ is fixed and the left side $\bR$ is unconstrained. Far fewer results… Expand
13 Citations
Hybrid (V)CSPs and algebraic reductions
  • 4
  • PDF
Hybrid VCSPs with crisp and conservative valued templates
  • PDF
Searching for an algebra on CSP solutions
  • PDF
Testing the complexity of a valued CSP language
  • 1
  • PDF
Hybrid VCSPs with Crisp and Valued Conservative Templates
  • PDF
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns*
  • 8
  • PDF
The Complexity of General-Valued CSPs
  • 56
  • PDF
Hybrid Tractable Classes of Constraint Problems
  • 17
  • PDF
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
  • 6
  • PDF
Even delta-matroids and the complexity of planar boolean CSPs
  • 2


A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
  • 55
  • PDF
Domain permutation reduction for constraint satisfaction problems
  • 26
  • Highly Influential
A dichotomy theorem for constraint satisfaction problems on a 3-element set
  • 316
Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems
  • 98
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
  • 1,017
  • PDF
Complexity of conservative constraint satisfaction problems
  • 137
  • PDF
The complexity of homomorphism and constraint satisfaction problems seen from the other side
  • Martin Grohe
  • Mathematics, Computer Science
  • 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
  • 141
The complexity of conservative valued CSPs
  • 68
  • PDF
The complexity of satisfiability problems
  • 1,869
  • PDF
Hybrid tractability of valued constraint problems
  • 50
  • PDF