No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

arXiv2003.11764MaRDI QIDQ6337441FDOQ6337441

Authors: D. N. Zhuk 

Publication date: 26 March 2020

Abstract: The 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, where a surjective assignment is an assignment containing all elements of the domain. In this paper we show that the most famous SCSP, called No-Rainbow Problem, is NP-Hard. Additionally, we disprove the conjecture saying that the SCSP over a constraint language $Gamma$ and the CSP over the same language with constants have the same computational complexity up to poly-time reductions. Our counter-example also shows that the complexity of the SCSP cannot be described in terms of polymorphisms of the constraint language.

This page was built for publication: No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337441)