collaborators

1 paper

math.LO2025

Proof complexity of Mal'tsev CSP

Azza Gaysin

Constraint Satisfaction Problems (CSPs) form a broad class of combinatorial problems, which can be formulated as homomorphism problems between relational structures. The CSP dichot…