20 citations · 27 across the 3 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011★ 20 cited
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
Andreas Galanis, Qi Ge, Daniel Stefankovic +2
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and…
math.PR2011
Strong spatial mixing of -colorings on Bethe lattices
Qi Ge, Daniel Stefankovic
We investigate the problem of strong spatial mixing of -colorings on Bethe lattices. By analyzing the sum-product algorithm we establish the strong spatial mixing of -colorin…