39 citations · 54 across the 12 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2005
Conditional Hardness for Approximate Coloring
Irit Dinur, Elchanan Mossel, Oded Regev
We study the coloring problem: Given a graph G, decide whether or , where c(G) is the chromatic number of G. We derive conditional hardness for this probl…
cs.CC2004★ 8 cited
A New Look at Survey Propagation and its Generalizations
Eliza N. Maneva, Elchanan Mossel, Martin J. Wainwright
This paper provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effect…