CSP for binary conservative relational structures

@article{Kazda2016CSPFB,
  title={CSP for binary conservative relational structures},
  author={A. Kazda},
  journal={Algebra universalis},
  year={2016},
  volume={75},
  pages={75-84}
}
  • A. Kazda
  • Published 2016
  • Mathematics
  • Algebra universalis
We prove that whenever $${\mathbb {A}}$$A is a 3-conservative relational structure with only binary and unary relations, then the algebra of polymorphisms of $${\mathbb {A}}$$A either has no Taylor operation (i.e., CSP($${\mathbb {A}}$$A) is NP-complete), or it generates an SD($${\wedge}$$∧) variety (i.e., CSP($${\mathbb {A}}$$A) has bounded width). 
5 Citations

Figures from this paper

Asking the Metaquestions in Constraint Tractability
  • 28
  • PDF
Space complexity of list H-colouring: a dichotomy
  • 15
  • PDF
Algebra and the Complexity of Digraph CSPs: a Survey
  • B. Larose
  • Computer Science
  • The Constraint Satisfaction Problem
  • 2017
  • 7
  • PDF
The Constraint Satisfaction Problem: Complexity and Approximability
  • 24
  • PDF
Tractability in constraint satisfaction problems: a survey
  • 31
  • PDF

References

SHOWING 1-10 OF 16 REFERENCES
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
  • 81
  • PDF
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
  • L. Barto
  • Mathematics, Computer Science
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
  • 74
  • PDF
Constraints and universal algebra
  • 49
On digraph coloring problems and treewidth duality
  • 19
  • PDF
The complexity of satisfiability problems
  • 1,869
  • PDF
The dichotomy of list homomorphisms for digraphs
  • 42
  • PDF
On the Reduction of the CSP Dichotomy Conjecture to Digraphs
  • 23
  • PDF
Classifying the Complexity of Constraints Using Finite Algebras
  • 552
  • PDF
Complexity of conservative constraint satisfaction problems
  • 137
  • PDF
CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES
  • 266
  • PDF
...
1
2
...