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 conservative finite−valued CSPs

The complexity of conservative finite−valued CSPs

Vladimir Kolmogorov and Stanislav Živný

Note
arXiv:1008.1555
Year
2010

Links

See Also

Back to Top