Bulatov–Jeavons–Krokhin algebraic dichotomy conjecture
Statement
Let be a finite relational structure, and let denote the problem of deciding whether a finite input structure has a homomorphism to . A core is the canonical core template referred to in the source, and a Taylor polymorphism is the polymorphism property used in the algebraic formulation. Bulatov–Jeavons–Krokhin's algebraic dichotomy conjecture. If is a core and has a Taylor polymorphism, then is solvable in polynomial time; otherwise, is NP-complete. This conjecture identifies the tractable side of the CSP dichotomy through polymorphisms and is presented as a stronger form of the general dichotomy conjecture. The paper reduces it to the corresponding statement for finite core digraphs.
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.