Feder–Vardi polynomial-time conjecture for CSPs excluding 1-IN-3 SAT
Statement
A constraint satisfaction problem (CSP) is a computational problem of deciding whether a finite set of variables can be assigned values from a finite domain so that all specified constraints are satisfied. The notation “simulate” refers to the reduction notion used in the source, and 1-IN-3 SAT is the Boolean constraint problem in which each constraint requires exactly one of three variables to be true. Feder–Vardi polynomial-time conjecture. Any CSP which cannot simulate 1-IN-3 SAT can be solved in polynomial time. The surrounding text states that this conjecture was proved correct.
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.