# Effectiveness of Structural Restrictions for Hybrid CSPs

@inproceedings{Kolmogorov2015EffectivenessOS,
title={Effectiveness of Structural Restrictions for Hybrid CSPs},
author={V. Kolmogorov and Michal Rolinek and Rustem Takhanov},
booktitle={ISAAC},
year={2015}
}
• Published in ISAAC 2015
• Mathematics, Computer Science
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

#### Topics from this paper

Hybrid (V)CSPs and algebraic reductions
• 4
• PDF
Searching for an algebra on CSP solutions
• PDF
Testing the complexity of a valued CSP language
• 1
• PDF
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns*
• Computer Science
• 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2016
• 8
• PDF
The Complexity of General-Valued CSPs
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
• 56
• PDF
Hybrid Tractable Classes of Constraint Problems
• Computer Science
• The Constraint Satisfaction Problem
• 2017
• 17
• PDF
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
• Mathematics, Computer Science
• SODA
• 2017
• 6
• PDF

#### References

SHOWING 1-10 OF 51 REFERENCES
Domain permutation reduction for constraint satisfaction problems
• Mathematics, Computer Science
• Artif. Intell.
• 2008
• 26
• Highly Influential
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
• Mathematics, Computer Science
• JACM
• 2013
• 68
• PDF
The complexity of satisfiability problems
• 1,869
• PDF
Hybrid tractability of valued constraint problems
• Mathematics, Computer Science
• Artif. Intell.
• 2011
• 50
• PDF