Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes.
Truly tight-in-∆ bounds for bipartite maximal matching and variants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes.