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

The complexity of finite−valued CSPs

Johan Thapper and Stanislav Živný

Book Title
Proceedings of the 45th ACM Symposium on the Theory of Computing (STOC'13)
Pages
695−704
Publisher
ACM
Year
2013

Links

See Also

Back to Top