Uniform sampling through the Lovasz local lemma
From MaRDI portal
Publication:4977984
DOI10.1145/3055399.3055410zbMath1370.68324arXiv1611.01647OpenAlexW2553830752MaRDI QIDQ4977984
Jing-Cheng Liu, Heng Guo, Mark R. Jerrum
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.01647
Combinatorics in computer science (68R05) Combinatorial probability (60C05) Randomized algorithms (68W20)
Related Items (8)
Counting Candy Crush configurations ⋮ Perfect sampling for Gibbs point processes using partial rejection sampling ⋮ What can be sampled locally? ⋮ Exact distributed sampling ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
This page was built for publication: Uniform sampling through the Lovasz local lemma
