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.
Optimal algorithms and inapproximability results for every CSP? In Proceedings of the fortieth annual ACM symposium on Theory of computing , pages 245--254
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.