CSP for binary conservative relational structures

Details CSP for binary conservative relational structures CSP for binary conservative relational structures

2011-12-05

arxiv.org/abs/1112.1099v1

Mathematics

Combinatorics

9 pages, 4 figures

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

CSP for binary conservative relational structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with CSP for binary conservative relational structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CSP for binary conservative relational structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379883