Proof complexity of universal algebra in a CSP dichotomy proof

Azza Gaysin

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}…