An exponential separation between randomized and deterministic complexity in the LOCAL model

DOI10.1109/FOCS.2016.72MaRDI QIDQ6946436zbMATH OpenFDO

Authors Tsvi Kopelowitz, Seth Pettie, Yi-Jun Chang

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.72

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Shared randomness helps with local distributed problems
• Shared randomness in locally checkable problems: the role of computational assumptions

This page was built for publication: An exponential separation between randomized and deterministic complexity in the LOCAL model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946436)