STOC 2016 · 48th ACM Symposium on Theory of Computing, Cambridge, MA, USA, June 2016 · doi:10.1145/2897518.2897570
We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires
Daniel Wichs and Yishay Mansour (Eds.): STOC’16, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pages 479–488, ACM Press, New York, 2016
ISBN 978-1-4503-4132-5