FPTAS for Counting Monotone CNF

@inproceedings{Liu2015FPTASFC,
  title={FPTAS for Counting Monotone CNF},
  author={Jingcheng Liu and Pinyan Lu},
  booktitle={SODA},
  year={2015}
}
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
Tweets
This paper has been referenced on Twitter 3 times. VIEW TWEETS

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Similar Papers

Loading similar papers…