A Galois Connection for Weighted (Relational) Clones of Infinite Size
arXiv:1502.05086 · doi:10.1145/2898438
Abstract
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-generated weighted clones and finitely-generated weighted relational clones [SICOMP'13], and asked whether this connection holds in general. We answer this question in the affirmative for weighted (relational) clones with real weights and show that the complexity of the corresponding valued CSPs is preserved.
References in corpus (6)
- The power of linear programming for general-valued CSPs
- The power of Sherali-Adams relaxations for general-valued CSPs
- Algebraic Properties of Valued Constraint Satisfaction Problem
- Necessary conditions for tractability of valued CSPs
- An Effective Fusion Technique of Cloud Computing and Networking Series
- Sherali-Adams relaxations for valued CSPs