Conditional hardness for approximate coloring

Irit Dinur, Elchanan Mossel, Oded Regev. Conditional hardness for approximate coloring. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 344-353, ACM, 2006. [doi]

@inproceedings{DinurMR06,
  title = {Conditional hardness for approximate coloring},
  author = {Irit Dinur and Elchanan Mossel and Oded Regev},
  year = {2006},
  doi = {10.1145/1132516.1132567},
  url = {http://doi.acm.org/10.1145/1132516.1132567},
  researchr = {https://researchr.org/publication/DinurMR06},
  cites = {0},
  citedby = {0},
  pages = {344-353},
  booktitle = {Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006},
  editor = {Jon M. Kleinberg},
  publisher = {ACM},
  isbn = {1-59593-134-1},
}