The metaproblem for coset-generating polymorphisms is NP-complete, and promise metaproblems for Maltsev-plus-abelian-heap pairs are in P even when the individual metaproblems remain open.
A Proof of Lemma 16 For convenience of the reader, we restate and give a proof of Lemma
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
CSPs solvable by slam Datalog are exactly those admitting a gadget reduction to a Boolean CSP, equivalently characterized by unfolded caterpillar duality and the existence of quasi Maltsev and k-absorptive operations, implying decidability of expressibility.
Universal algebra supplies cyclic terms and bounded-width conditions that classify the tractability of finite-domain CSPs via graph homomorphisms.
citing papers explorer
-
The complexity of finding coset-generating polymorphisms and the promise metaproblem
The metaproblem for coset-generating polymorphisms is NP-complete, and promise metaproblems for Maltsev-plus-abelian-heap pairs are in P even when the individual metaproblems remain open.
-
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
CSPs solvable by slam Datalog are exactly those admitting a gadget reduction to a Boolean CSP, equivalently characterized by unfolded caterpillar duality and the existence of quasi Maltsev and k-absorptive operations, implying decidability of expressibility.
-
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.