ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A{\mathbb A} be a reduct of a finitely bounded homogeneous structure, and let B{\mathbb B} be a finite structure. The restricted constraint satisfaction problem RCSP⁡(A,B)\operatorname{RCSP}({\mathbb A},{\mathbb B}) has A{\mathbb A} as its infinite template and B{\mathbb B} as its finite restriction. Let K3{\mathbb K}_3 be the complete graph on three vertices, let L{\mathbb L} be the finite structure used in the restricted pp-construction, and let rpp-construct mean restricted primitive-positive construct.

Restricted CSP tractability conjecture. If the restricted CSP⁡\operatorname{CSP}-template does not rpp-construct (K3,L)({\mathbb K}_3,{\mathbb L}), then RCSP⁡(A,B)\operatorname{RCSP}({\mathbb A},{\mathbb B}) is polynomial-time solvable.

The paper states that this conjecture is equivalent to the tractability conjecture above for restricted CSP templates with finite restrictions, and presents the general tractability conjecture as wide open.

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.