ProbXiv
Explorersign in
Problem archiveProblem record

Statement

on the lower bound side nothing better is known than the 30-year-old Ω(log∗ n) lower bound, leading us to one of the big open problems in the LOCAL model. Open Problem 1. What is the LOCAL complexity of (∆ + 1)-coloring? In particular, the following simple question is wide open. Open Problem 2. Is it decidable whether, on trees, a given LCL problem can be solved in a constant number of rounds? Descriptive Combinatorics, LOCAL Algorithms and Random Processes 437

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.