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.
An Algorithmic Blend of LPs and Ring Equations for Promise CSPs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Fourier analysis of Boolean functions yields two phenomena—preservation of coordinate influence under random 2-to-1 minors and sharp thresholds—that classify hardness and tractability for Boolean PCSP minions of unate or polynomial threshold functions, extending prior ordered-PCSP results.
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.
-
Boolean PCSPs through the lens of Fourier Analysis
Fourier analysis of Boolean functions yields two phenomena—preservation of coordinate influence under random 2-to-1 minors and sharp thresholds—that classify hardness and tractability for Boolean PCSP minions of unate or polynomial threshold functions, extending prior ordered-PCSP results.