CSP for binary conservative relational structures
classification
🧮 math.CO
keywords
binaryconservativerelationalalgebraboundedcongruenceeithergenerates
read the original abstract
We prove that whenever A is a 3-conservative relational structure with only binary and unary relations then the algebra of polymorphisms of A either has no Taylor operation (i.e. CSP(A) is NP-complete), or generates a congruence meet semidistributive variety (i.e. CSP(A) has bounded width).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.