Feder–Vardi bounded-width conjecture for CSPs
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. A CSP has the ability to count when it admits the obstruction described by Feder and Vardi using ternary and unary relations. Feder–Vardi bounded-width conjecture. Any CSP which cannot simulate a CSP with the ability to count does have bounded width. This conjecture was proved correct, as stated in the surrounding text; the result also holds when one only excludes simulation of affine CSPs.
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.