The paper reformulates polymorphisms in CSPs and PCSPs as right Kan extensions and supplies purely categorical proofs that complexity is determined by these structures.
Finite algebras with hom-sets of polynomial size.Trans
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.
citing papers explorer
-
A categorical perspective on constraint satisfaction: The wonderland of adjunctions
The paper reformulates polymorphisms in CSPs and PCSPs as right Kan extensions and supplies purely categorical proofs that complexity is determined by these structures.
-
Equations over Finite Monoids with Infinite Promises
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.