ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\Gamma be a finite constraint language with all constants. Its polymorphism clone Pol⁡(Γ)\operatorname{Pol}(\Gamma) has the polynomially generated powers (PGP) property if, for some polynomial pp, every power DnD^n has a generating subset of size at most p(n)p(n) under Pol⁡(Γ)\operatorname{Pol}(\Gamma), where DD is the domain of Γ\Gamma. Chen Conjecture. If Pol⁡(Γ)\operatorname{Pol}(\Gamma) has PGP, then QCSP⁡(Γ)\operatorname{QCSP}(\Gamma) is in NP; otherwise QCSP⁡(Γ)\operatorname{QCSP}(\Gamma) is PSpace-complete. This conjecture proposes a dichotomy for the complexity of quantified constraint satisfaction problems: the PGP case admits an NP upper bound, while failure of PGP should force PSpace-completeness. It is identified in the source as the outstanding conjecture in the area; its resolution status is not specified here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.