ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 1in3\mathbf{1in3} and Cˇ+\mathbf{\check{C}^+} be the finite relational templates used in the paper, with a homomorphism 1in3→Cˇ+\mathbf{1in3}\to\mathbf{\check{C}^+}. The associated promise constraint satisfaction problem is PCSP(1in3,Cˇ+)\mathrm{PCSP}(\mathbf{1in3},\mathbf{\check{C}^+}). Cˇ+\mathbf{\check{C}^+} hardness conjecture. PCSP(1in3,Cˇ+)\mathrm{PCSP}(\mathbf{1in3},\mathbf{\check{C}^+}) is NP-hard. The paper presents this as an unresolved four-element case and provides evidence for, but does not establish, the claimed hardness.

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.