## Approximation via Correlation Decay When Strong Spatial Mixing Fails

- Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
- SIAM J. Comput.
- 2019

Highly Influenced

27 Excerpts

@inproceedings{Liu2015FPTASFC, title={FPTAS for Counting Monotone CNF}, author={Jingcheng Liu and Pinyan Lu}, booktitle={SODA}, year={2015} }

- Published in SODA 2015
DOI:10.1137/1.9781611973730.101

A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments for a given monotone CNF formula when each variable appears in at most 5 clauses. Equivalently, this is also an FPTAS for counting set covers where each set contains at most 5 elements. If we allow variables to appear in a maximum of 6 clauses (or sets to… CONTINUE READING