Larose–Tesson conjecture on Kearnes–Kiss chains and NL

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.

Sources & referencesView supporting material

Primary source

Manuel Bodirsky, Jakub Bulín, Florian Starke and Michael Wernthaler, “The Smallest Hard Trees”, arXiv:2205.07528 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.