NP-hardness conjecture for PCSP(1in3,checkC^+)
Statement
Let and be the finite relational templates used in the paper, with a homomorphism . The associated promise constraint satisfaction problem is . hardness conjecture. 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.