ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B\mathfrak{B} be a normal representation of a finite relation algebra A\mathbf{A}. A primitive-positive interpretation is an interpretation defined by primitive-positive formulas, and B\mathfrak{B} pp-constructs a structure if it pp-interprets a homomorphically equivalent structure. Let ({0,1};NAE⁡)(\{0,1\};\operatorname{NAE}) denote the Boolean structure with the not-all-equal relation. Write CSP⁡(B)\operatorname{CSP}(\mathfrak{B}) for the constraint satisfaction problem of B\mathfrak{B} and NSP⁡(A)\operatorname{NSP}(\mathbf{A}) for the network satisfaction problem of A\mathbf{A}.

Tractability conjecture. If B\mathfrak{B} does not pp-construct ({0,1};NAE⁡)(\{0,1\};\operatorname{NAE}), then

CSP⁡(B) and NSP⁡(A) are in P⁡.\operatorname{CSP}(\mathfrak{B})\text{ and }\operatorname{NSP}(\mathbf{A})\text{ are in }\operatorname{\mathbf{P}}.

If the stated pp-construction condition holds, the CSP is known to be NP⁡\operatorname{\mathbf{NP}}-hard; the conjecture asserts polynomial-time tractability in the complementary case. It is presented as a specialization of the broader dichotomy conjecture for reducts of finitely bounded homogeneous structures.

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.