Skip to main content
University of Oxford Department of Computer Science
  Contact Us     Search  
  1. Home
  2. Research
  3. Algorithms and Complexity Theory
  4. Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms

Vladimir Kolmogorov and Stanislav Živný

Note
arXiv:1008.3104
Year
2010

Links

See Also

Back to Top