The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
DOI10.1137/1.9781611974331.ch34zbMath1409.68139OpenAlexW2950929157MaRDI QIDQ4575611
Leslie Ann Goldberg, Andreas Galanis
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch34
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
