ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Next, we collect the open problems, see also [1, 2, 3, 4, 5, 6, 7, 8]: Finitary fiid The finitary factor of iid formalism [8], or equivalently the model of uniform local algorithms [7], offers finer scale to measure complexity of local problems than the one provided by the LOCAL model of distributed computing. Is there always a Borel unfriendly coloring? General questions • Is there a general complexity theory of local problems on general classes of graphs? • What techniques in one field admit interpretation in one of the other fields? Descriptive Combinatorics, LOCAL Algorithms and Random Processes 439

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.