Beyond Boolean Surjective VCSPs

01/21/2019
by   Gregor Matl, et al.
0

Fulla, Uppman, and Zivny [ACM ToCT'18] established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution. This result, in addition to identifying the complexity frontier, features the discovery of a new non-trivial tractable case (called EDS) that does not appear in the non-surjective setting. In this work, we go beyond Boolean domains. As our main result, we introduce a generalisation of EDS to arbitrary finite domains called SEDS (similar to EDS) and establish a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains. This gives a complete classification of SEDS VCSPs on three-element domains. The basis of our tractability result is a natural generalisation of the Min-Cut problem, in which only solutions of certain size (given by a lower and upper bound) are permitted. We show that all near-optimal solutions to this problem can be enumerated in polynomial time, which might be of independent interest.

READ FULL TEXT
research
06/28/2021

Additive Sparsification of CSPs

Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC'9...
research
03/09/2021

Several Separations Based on a Partial Boolean Function

We show a partial Boolean function f together with an input x∈ f^-1(*) s...
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...
research
04/29/2019

Dichotomy for symmetric Boolean PCSPs

A PCSP is a combination of two CSPs defined by two similar templates; th...
research
06/17/2019

On the Strength of Uniqueness Quantification in Primitive Positive Formulas

Uniqueness quantification (∃ !) is a quantifier in first-order logic whe...
research
04/13/2018

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

We analyse the complexity of approximate counting constraint satisfactio...
research
06/29/2020

Ideal Membership Problem for Boolean Minority

The Ideal Membership Problem (IMP) tests if an input polynomial f∈𝔽[x_1,...

Please sign up or login with your details

Forgot password? Click here to reset