The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
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 gene...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Association for Computing Machinery
2021
|
| Summary: | 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). |
|---|