The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
arXiv:2007.01779 · doi:10.1145/3458041
Abstract
Convex relaxations have been instrumental in solvability of constraint satisfaction problems (CSPs), as well as in the three different generalisations of CSPs: valued CSPs, infinite-domain CSPs, and most recently promise CSPs. In this work, we extend an existing tractability result to the three generalisations of CSPs combined: We give a sufficient condition for the combined basic linear programming and affine integer programming relaxation for exact solvability of promise valued CSPs over infinite-domains. This extends a result of Brakensiek and Guruswami [SODA'20] for promise (non-valued) CSPs (on finite domains).
arXiv commentFull version of an MFCS'20 paper
References in corpus (11)
- Generalized Convexity and Inequalities
- Algebraic approach to promise constraint satisfaction
- The Power of Linear Programming for Valued CSPs
- The power of linear programming for general-valued CSPs
- Essential Convexity and Complexity of Semi-Algebraic Constraints
- The complexity of finite-valued CSPs
- An Algebraic Theory of Complexity for Discrete Optimisation
- The power of Sherali-Adams relaxations for general-valued CSPs
- The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs
- Algebraic Properties of Valued Constraint Satisfaction Problem
- The limits of SDP relaxations for general-valued CSPs