Showing math.LOShow all
4 papers · 1 filter
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…
math.LO2024
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 , for any structure $\mathcal{X}…
math.LO2022
Proof complexity of CSP
Azza Gaysin
The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichot…
math.LO2020
H-coloring Dichotomy in Proof Complexity
Azza Gaysin
The -coloring problem for undirected simple graphs is a computational problem from a huge class of the constraint satisfaction problems (CSP): an -colorin…