Is Constraint Satisfaction Over Two Variables Always Easy?

Lars Engebretsen, Venkatesan Guruswami. Is Constraint Satisfaction Over Two Variables Always Easy?. In José D. P. Rolim, Salil P. Vadhan, editors, Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Volume 2483 of Lecture Notes in Computer Science, pages 224-238, Springer, 2002. [doi]

@inproceedings{EngebretsenG02,
  title = {Is Constraint Satisfaction Over Two Variables Always Easy?},
  author = {Lars Engebretsen and Venkatesan Guruswami},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2483/24830224.htm},
  tags = {constraints},
  researchr = {https://researchr.org/publication/EngebretsenG02},
  cites = {0},
  citedby = {0},
  pages = {224-238},
  booktitle = {Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
  editor = {José D. P. Rolim and Salil P. Vadhan},
  volume = {2483},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44147-6},
}