2 problems

Let $\mathbb{A}$ be a finite idempotent algebra, meaning that every basic operation satisfies $f(x,\ldots,x)=x$. Bounded relational-width term conjecture. The algebra $\mathbb{A}$…

A constraint satisfaction problem (CSP) is a computational problem of deciding whether a finite set of variables can be assigned values from a finite domain so that all specified c…