AI Chat AI Image Generator AI Video Text to Speech

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

03/26/2020

∙

by Dmitriy Zhuk, et al.

∙

∙

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints. In this paper we show that one of the most popular variants of the SCSP, called No-Rainbow Problem, is NP-Hard. Additionally, we disprove the conjecture saying that SCSP over a constraint language Γ is equivalent to CSP over the same language with constants. Our counter example also shows that the complexity of SCSP cannot be described in terms of polymorphisms of the constraint language.

research

∙ 03/26/2020

No-Rainbow Problem is NP-Hard

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...

0 Dmitriy Zhuk, et al. ∙

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

0 Andrei A. Bulatov, et al. ∙

research

∙ 03/08/2011

On Minimal Constraint Networks

In a minimal binary constraint network, every tuple of a constraint rela...

0 Georg Gottlob, et al. ∙

research

∙ 05/01/2020

Strong subalgebras and the Constraint Satisfaction Problem

In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP...

0 Dmitriy Zhuk, et al. ∙

research

∙ 09/19/2022

Translationally Invariant Constraint Optimization Problems

We study the complexity of classical constraint satisfaction problems on...

0 Dorit Aharonov, et al. ∙

research

∙ 05/03/2023

Short definitions in constraint languages

A first-order formula is called primitive positive (pp) if it only admit...

0 Jakub Bulín, et al. ∙

research

∙ 11/17/2011

Unbiased Statistics of a CSP - A Controlled-Bias Generator

We show that estimating the complexity (mean and distribution) of the in...

0 Denis Berthier, et al. ∙