Dichotomy for finite tournaments of mixed-type

@article{Wires2015DichotomyFF,
  title={Dichotomy for finite tournaments of mixed-type},
  author={A. Wires},
  journal={Discret. Math.},
  year={2015},
  volume={338},
  pages={2523-2538}
}
  • A. Wires
  • Published 2015
  • Mathematics, Computer Science
  • Discret. Math.
We characterize those finite tournaments T of mixed-type which admit a Taylor operation; in this case, the corresponding algebras of polymorphisms generate congruence meet-semidistributive varieties. If T c denotes the structure with all unary singleton relations in addition to the edge relation of the tournament, then it will follow that the constraint satisfaction problem with template T c satisfies the algebraic dichotomy conjecture. 
Algebra and the Complexity of Digraph CSPs: a Survey
  • B. Larose
  • Computer Science
  • The Constraint Satisfaction Problem
  • 2017
Quantified Constraints in Twenty Seventeen
  • B. Martin
  • Computer Science
  • The Constraint Satisfaction Problem
  • 2017
The Constraint Satisfaction Problem: Complexity and Approximability

References

SHOWING 1-10 OF 29 REFERENCES
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
The complexity of colouring by locally semicomplete digraphs
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
  • T. Feder
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2001
Complexity of Tree Homomorphisms
Constraint Satisfaction Problems and Finite Algebras
...
1
2
3
...