FPTAS for Counting Monotone CNF
From MaRDI portal
Publication:5363014
DOI10.1137/1.9781611973730.101zbMath1371.68324arXiv1311.3728OpenAlexW2951646392MaRDI QIDQ5363014
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.3728
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (8)
Sequential Monte Carlo for counting vertex covers in general graphs ⋮ Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs ⋮ Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems ⋮ Approximation via Correlation Decay When Strong Spatial Mixing Fails ⋮ Counting hypergraph matchings up to uniqueness threshold ⋮ Stochastic enumeration method for counting trees ⋮ Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
This page was built for publication: FPTAS for Counting Monotone CNF
