8 citations · 11 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 8 cited
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
Pinyan Lu, Kuan Yang, Chihao Zhang +1
Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approxima…
cs.DS2016
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
Andreas Galanis, Leslie Ann Goldberg, Kuan Yang
We study the complexity of approximate counting Constraint Satisfaction Problems (#CSPs) in a bounded degree setting. Specifically, given a Boolean constraint language and a de…