# 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} }

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

#### Topics from this paper

#### 13 Citations

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

A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem

- Computer Science, Mathematics
- STACS
- 2010

55- PDF

Domain permutation reduction for constraint satisfaction problems

- Mathematics, Computer Science
- Artif. Intell.
- 2008

26 Highly Influential

A dichotomy theorem for constraint satisfaction problems on a 3-element set

- Mathematics, Computer Science
- JACM
- 2006

316

Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems

- Computer Science
- AAAI
- 1993

98

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

- Mathematics, Computer Science
- SIAM J. Comput.
- 1998

1,017- PDF

Complexity of conservative constraint satisfaction problems

- Mathematics, Computer Science
- TOCL
- 2011

137- PDF

The complexity of homomorphism and constraint satisfaction problems seen from the other side

- Mathematics, Computer Science
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- 2003

141

Hybrid tractability of valued constraint problems

- Mathematics, Computer Science
- Artif. Intell.
- 2011

50- PDF