ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A\mathbb{A} be a finite relational structure, and let CSP⁡(A)\operatorname{CSP}(\mathbb{A}) denote the problem of deciding whether a finite input structure has a homomorphism to A\mathbb{A}. A core is the canonical core template referred to in the source, and a Taylor polymorphism is the polymorphism property used in the algebraic formulation. Bulatov–Jeavons–Krokhin's algebraic dichotomy conjecture. If A\mathbb{A} is a core and has a Taylor polymorphism, then CSP⁡(A)\operatorname{CSP}(\mathbb{A}) is solvable in polynomial time; otherwise, CSP⁡(A)\operatorname{CSP}(\mathbb{A}) is NP-complete. This conjecture identifies the tractable side of the CSP dichotomy through polymorphisms and is presented as a stronger form of the general dichotomy conjecture. The paper reduces it to the corresponding statement for finite core digraphs.

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.