Prefer a chat interface with context about you and your work?
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
Let 𝔸 be an idempotent algebra on a finite domain. By mediating between results of Chen [ 1 ] and Zhuk [ 2 ], we argue that if 𝔸 satisfies the polynomially generated powers property (PGP) and ℬ is a constraint language invariant under 𝔸 (i.e., in Inv(𝔸)), then QCSP …