#### Filter Results:

#### Publication Year

2014

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jingcheng Liu, Pinyan Lu
- SODA
- 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… (More)

- Chengyu Lin, Jingcheng Liu, Pinyan Lu
- SODA
- 2014

An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of edge covers for any graph. Previously, approximation algorithm is only known for 3 regular graphs and it is randomized. Our main technique… (More)

- Jingcheng Liu, Pinyan Lu, Chihao Zhang
- ESA
- 2014

An edge cover of a graph is a set of edges in which each vertex has at least one of its incident edges. The problem of counting the number of edge covers is #P-complete and was shown to admit a fully polynomial-time approximation scheme (FPTAS) recently [10]. Counting weighted edge covers is the problem of computing the sum of the weights for all the edge… (More)

- Jingcheng Liu, Pinyan Lu
- STOC
- 2015

Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for #BIS, and it was proved that the problem for instances with a maximum degree of 6 is already as hard as the general… (More)

- Jingcheng Liu, Pinyan Lu, Chihao Zhang
- APPROX-RANDOM
- 2014

We study the approximability of computing the partition function for ferromagnetic two-state spin systems. The remarkable algorithm by Jerrum and Sinclair showed that there is a fully polynomial-time randomized approximation scheme (FPRAS) for the special ferromag-netic Ising model with any given uniform external field. Later, Goldberg and Jerrum proved… (More)

- Jingcheng Liu, Pinyan Lu
- ArXiv
- 2014

- ‹
- 1
- ›