Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy

@inproceedings{Fischer2017SublogarithmicDA,
  title={Sublogarithmic Distributed Algorithms for Lov{\'a}sz Local Lemma, and the Complexity Hierarchy},
  author={Manuela Fischer and Mohsen Ghaffari},
  booktitle={DISC},
  year={2017}
}
Locally Checkable Labeling (LCL) problems include essentially all the classic problems of LOCAL distributed algorithms. In a recent enlightening revelation, Chang and Pettie [FOCS’17] showed that any LCL (on bounded degree graphs) that has an o(logn)-round randomized algorithm can be solved in TLLL(n) rounds, which is the randomized complexity of solving (a relaxed variant of) the Lovász Local Lemma (LLL) on bounded degree n-node graphs. Currently, the best known upper bound on TLLL(n) is O… CONTINUE READING
Tweets
This paper has been referenced on Twitter 2 times. VIEW TWEETS

Similar Papers

Loading similar papers…