Decidability of Constant-Time LCL Problems on Trees
Statement
Is it decidable whether, on trees, a given locally checkable labeling (LCL) problem can be solved in a constant number of rounds?
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.