ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B\mathfrak{B} be a first-order reduct of a finitely bounded homogeneous structure in a finite relational signature. The constraint satisfaction problem CSP⁡(B)\operatorname{CSP}(\mathfrak{B}) asks whether a finite input structure admits a homomorphism to B\mathfrak{B}. Infinite-domain CSP dichotomy conjecture. The problem CSP⁡(B)\operatorname{CSP}(\mathfrak{B}) is either in P\mathbf{P} or is NP\mathbf{NP}-complete. This extends the finite-domain CSP dichotomy to the indicated class of infinite-domain templates; the source presents it as open and attributes it to earlier work.

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.