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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.