Bulín's easy-trees-cannot-count conjecture
Statement
A tree is an orientation of a finite undirected tree. A tree has the ability to count if its constraint satisfaction problem can encode solving systems of linear equations over for some prime , equivalently making it ModL-hard in the sense used in the paper. Bulín's conjecture. If a tree is not NP-hard, then it cannot count; equivalently, if a tree has the ability to count, then it is NP-hard. This conjecture proposes an NP-hardness-versus-bounded-width dichotomy for trees. It is presented as open in the paper, with only a large structurally restricted subclass established.
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.