A minion-theoretic characterization unifies the power of higher-level CSP algorithms and introduces an equivalent Z_p vector relaxation hierarchy that solves the dihedral D4 CSP and modular linear equations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
All semilattices of Mal'cev blocks induce tractable CSP templates, reproving Bulatov's result while comparing two proofs of the CSP dichotomy theorem.
citing papers explorer
-
Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
A minion-theoretic characterization unifies the power of higher-level CSP algorithms and introduces an equivalent Z_p vector relaxation hierarchy that solves the dihedral D4 CSP and modular linear equations.
-
SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
All semilattices of Mal'cev blocks induce tractable CSP templates, reproving Bulatov's result while comparing two proofs of the CSP dichotomy theorem.