Egri–Larose–Tesson conjecture on Noname chains and L
Egri–Larose–Tesson conjecture on Noname chains and L
Let be a finite structure with finite relational signature, and let its polymorphisms be the operations preserving the relations of . A Noname chain is the chain defined in Section~. Egri–Larose–Tesson's conjecture. If the polymorphisms of contain a Noname chain, then
As with the NL conjecture, failure of the condition yields hardness for complexity classes not believed to lie in L. The conjecture remains open, including for finite digraphs and orientations of finite trees.
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.