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.
24 Moritz Lichter and Benedikt Pago
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
-
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.