Approximate counting, the Lovasz local lemma, and inference in graphical models
From MaRDI portal
Publication:4977985
DOI10.1145/3055399.3055428zbMath1370.68138arXiv1610.04317OpenAlexW2536405182MaRDI QIDQ4977985
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/1610.04317
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Approximate counting, the Lovasz local lemma, and inference in graphical models
