Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness

Venkatesan Guruswami, Prasad Raghavendra. Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. Electronic Colloquium on Computational Complexity (ECCC), 15(008), 2008. [doi]

@article{GuruswamiR08-0,
  title = {Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness},
  author = {Venkatesan Guruswami and Prasad Raghavendra},
  year = {2008},
  url = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-008/index.html},
  tags = {constraints},
  researchr = {https://researchr.org/publication/GuruswamiR08-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {15},
  number = {008},
}