ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d54fAd54f\mathbb A be a finite relational structure, and let CSP(A)\mathrm{CSP}(\mathbb A) denote the decision problem asking whether an input structure of the same type admits a homomorphism to A\mathbb A.

The CSP dichotomy conjecture. For every finite relational structure A\mathbb A, CSP(A)\mathrm{CSP}(\mathbb A) is in P or NP-complete.

This conjecture asserts that finite-domain constraint satisfaction problems have no intermediate complexity, assuming P ≠\neq NP. It was formulated by Feder and Vardi and is known as the CSP dichotomy conjecture.

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.