The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Computational Complexity
2021-07-20 v2 Discrete Mathematics
Data Structures and Algorithms
Logic in Computer Science
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).
Keywords
Cite
@article{arxiv.2007.01779,
title = {The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains},
author = {Caterina Viola and Stanislav Zivny},
journal= {arXiv preprint arXiv:2007.01779},
year = {2021}
}
Comments
Full version of an MFCS'20 paper