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 valued constraint satisfaction

The complexity of valued constraint satisfaction

Peter Jeavons‚ Andrei Krokhin and Stanislav Živný

Journal
Bulletin of the European Association for Theoretical Computer Science (EATCS)
Note
Errata can be found here.
Pages
21−55
Volume
113
Year
2014

Links

See Also

Back to Top