20 citations · 45 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013★ 1 cited
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Andreas Galanis, Daniel Stefankovic, Eric Vigoda +1
Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a ph…
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…