An Algebraic Hardness Criterion for Surjective Constraint Satisfaction

05/19/2014
by   Hubie Chen, et al.
0

The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the constraints; the surjective CSP is the variant where one decides the existence of a surjective satisfying assignment onto the universe of B. We present an algebraic condition on the polymorphism clone of B and prove that it is sufficient for the hardness of the surjective CSP on a finite structure B, in the sense that this problem admits a reduction from a certain fixed-structure CSP. To our knowledge, this is the first result that allows one to use algebraic information from a relational structure B to infer information on the complexity hardness of surjective constraint satisfaction on B. A corollary of our result is that, on any finite non-trivial structure having only essentially unary polymorphisms, surjective constraint satisfaction is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2020

Algebraic Global Gadgetry for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a finite relational structu...
research
04/04/2016

Asking the metaquestions in constraint tractability

The constraint satisfaction problem (CSP) involves deciding, given a set...
research
05/01/2020

Sensitive instances of the Constraint Satisfaction Problem

We investigate the impact of modifying the constraining relations of a C...
research
05/23/2020

Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction

To study the question under which circumstances small solutions can be f...
research
09/19/2022

Translationally Invariant Constraint Optimization Problems

We study the complexity of classical constraint satisfaction problems on...
research
07/16/2020

A dichotomy theorem for nonuniform CSPs simplified

In a non-uniform Constraint Satisfaction problem CSP(G), where G is a se...
research
03/31/2022

Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep

A Constraint Satisfaction Problem (CSP) is a computational problem where...

Please sign up or login with your details

Forgot password? Click here to reset