Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Algorithms
  4. The complexity of conservative valued CSPs

The complexity of conservative valued CSPs

Vladimir Kolmogorov and Stanislav Živný

Journal
Journal of the ACM
Note
Article No. 10
Number
2
Volume
60
Year
2013

Links

See Also

Back to Top