Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma

DOI10.1145/3392035OpenAlexW3041542062WikidataQ125052174 ScholiaQ125052174MaRDI QIDQ5028338

David G. Harris

Publication date: 8 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

resamplingLovász local lemmaLLLlopsided Lovász local lemmalexicographically first MISLFMISLLLL

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 (1)

Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel

This page was built for publication: Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma