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.
The power of the combined basic LP and affine relaxation for promise CSPs.SIAM J
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
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.
The paper reformulates polymorphisms in CSPs and PCSPs as right Kan extensions and supplies purely categorical proofs that complexity is determined by these structures.
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.
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.
-
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.