Constraint Satisfaction Problems, and Relaxing Them Semidefinitely

Constraint satisfaction problems constitute an important and much studied class of computational problems. We will discuss them from the point of view of SDP-based approximation algorithms. They are also investigated from other angles, each of them giving rise to a major field of research. We will mention some of these other aspects only very briefly and omit others completely.