10 citations · 63 across the 24 of their papers we have counts for
1 paper · 2 filters
Irit Dinur, Elchanan Mossel, Oded Regev
We study the coloring problem: Given a graph G, decide whether c(G)≤q or c(G)≥Q, where c(G) is the chromatic number of G. We derive conditional hardness for this probl…