ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a finite domain and let Γ\Gamma be a constraint language on AA. Write CSP⁡(Γ)\operatorname{CSP}(\Gamma) for the ordinary constraint satisfaction problem and SCSP⁡(Γ)\operatorname{SCSP}(\Gamma) for the problem asking whether an instance has a surjective satisfying assignment. Let {{a}∣a∈A}\{\{a\}\mid a\in A\} denote the unary singleton relations. Chen's conjecture. For any constraint language Γ\Gamma, the problems

CSP⁡(Γ∪{{a}∣a∈A})andSCSP⁡(Γ)\operatorname{CSP}\left(\Gamma\cup\{\{a\}\mid a\in A\}\right)\quad\text{and}\quad \operatorname{SCSP}(\Gamma)

are polynomially equivalent. This conjecture was proposed as a polymorphism-based characterization of SCSP complexity, but the paper disproves it by giving a counterexample; it is known for two-element domains.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.