Larose–Tesson conjecture on Kearnes–Kiss chains and NL
Statement
Let 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 contain a Kearnes–Kiss chain, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.