The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

July 03, 2020 · The Ethereal · 🏛 International Symposium on Mathematical Foundations of Computer Science

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Caterina Viola, Stanislav Zivny arXiv ID 2007.01779 Category cs.CC: Computational Complexity Cross-listed cs.DM, cs.DS, cs.LO Citations 11 Venue International Symposium on Mathematical Foundations of Computer Science Last Checked 2 months ago

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).