Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Algorithms and Complexity Theory
  4. The complexity of constraint satisfaction games and QCSP

The complexity of constraint satisfaction games and QCSP

Ferdinand Börner‚ Andrei A. Bulatov‚ Hubie Chen‚ Peter Jeavons and Andrei A. Krokhin

Journal
Inf. Comput.
Number
9
Pages
923−944
Volume
207
Year
2009

Links

See Also

Back to Top