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

07/03/2020
by   Caterina Viola, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2022

Weisfeiler-Leman Invariant Promise Valued CSPs

In a recent line of work, Butti and Dalmau have shown that a fixed-templ...
research
07/11/2021

CLAP: A New Algorithm for Promise CSPs

We propose a new algorithm for Promise Constraint Satisfaction Problems ...
research
08/09/2022

An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains

We show a universal algebraic local characterisation of the expressive p...
research
11/06/2022

Approximate Graph Colouring and the Hollow Shadow

We show that approximate graph colouring is not solved by constantly man...
research
09/14/2017

On Coordinate Minimization of Convex Piecewise-Affine Functions

A popular class of algorithms to optimize the dual LP relaxation of the ...
research
07/13/2018

An Algorithmic Blend of LPs and Ring Equations for Promise CSPs

Promise CSPs are a relaxation of constraint satisfaction problems where ...
research
10/07/2022

Boolean symmetric vs. functional PCSP dichotomy

Given a 3-uniform hypergraph (V,E) that is promised to admit a {0,1}-col...

Please sign up or login with your details

Forgot password? Click here to reset