ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Δ\Delta be a finitely bounded homogeneous structure, and let Γ\Gamma be a finite-language reduct of Δ\Delta. The constraint satisfaction problem of Γ\Gamma is denoted by CSP⁡(Γ)\operatorname{CSP}(\Gamma).

Dichotomy conjecture. CSP⁡(Γ)\operatorname{CSP}(\Gamma) is either in P or NP-complete.

Complete classifications with this dichotomy were known for the empty structure, the rationals with their usual order, and the random graph. The conjecture proposes that the same P-versus-NP-complete classification holds for every finite-language reduct of a finitely bounded homogeneous structure; membership in NP is already known in this setting.

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.