Universal algebra supplies cyclic terms and bounded-width conditions that classify the tractability of finite-domain CSPs via graph homomorphisms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Homomorphisms and Universal Algebra
Universal algebra supplies cyclic terms and bounded-width conditions that classify the tractability of finite-domain CSPs via graph homomorphisms.