Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma

DOI10.1137/1.9781611975482.52zbMath1431.68128arXiv1702.02547OpenAlexW2796178541MaRDI QIDQ5236235

David G. Harris

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.02547

Mathematics Subject Classification ID

Combinatorial probability (60C05) Extremal set theory (05D05) Parallel algorithms in computer science (68W10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

A General Framework for Hypergraph Coloring ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Unnamed Item ⋮ New bounds for the Moser‐Tardos distribution

This page was built for publication: Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma