Affiliation:
1. University of Oxford, United Kingdom
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).
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference57 articles.
1. Generalized convexity and inequalities
2. Konvexe Funktionen und Induktion bei Ungleichungen zwischen Mittelverten. Akad. Wiss. Math.-Natur. Kl. Abh;Aumann G;Math. Ann,1933
3. On the usefulness of predicates
4. Correlation Clustering
5. Algebraic approach to promise constraint satisfaction;Barto Libor;Journal of the ACM. DOI:DOI,2019
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献