The core-free finite tractability conjecture via height-1 clone homomorphisms
Statement
Let be a finite relational structure, and let be its polymorphism clone. Let be the clone of projections on a two-element set, and let an h1 clone homomorphism mean a homomorphism preserving identities of height . Core-free finite tractability conjecture. One of the following holds: maps to via an h1 clone homomorphism, in which case is NP-complete, or is solvable in polynomial time. This is the core-free reformulation of the finite tractability conjecture, enabled by the equivalence between the relevant clone-homomorphism, cyclic-operation, and Siggers-operation conditions.
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.