The bounded width dichotomy conjecture for constraint satisfaction problems
Statement
Let be a finite core relational structure of finite relational signature. A polymorphism of is an operation that is a homomorphism from a direct power of to . A weak near unanimity operation (WNU) is an idempotent operation satisfying
for all . The constraint satisfaction problem asks whether a finite relational structure has a homomorphism to . The bounded width dichotomy conjecture. If has a WNU polymorphism, then is tractable. If has no WNU polymorphism, then is -complete. This conjecture refines the Feder–Vardi dichotomy conjecture and proposes that the presence of a WNU polymorphism exactly characterizes tractable finite-core constraint satisfaction problems. The source does not state a resolution, so its status is recorded as open.
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.