ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H\mathbb{H} be a finite structure with finite relational signature, and let its polymorphisms be the edge-preserving operations on its domain. A Kearnes–Kiss chain is the chain defined in Section~. Larose–Tesson's conjecture. If the polymorphisms of H\mathbb{H} contain a Kearnes–Kiss chain, then

CSP⁡(H) is in NL.\operatorname{CSP}(\mathbb{H})\text{ is in NL}.

The converse hardness results show that failure of the condition implies hardness for classes not believed to lie in NL. The conjecture is wide open and is regarded as one of the most difficult open problems in finite-domain constraint satisfaction.

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.