The CSP dichotomy conjecture
Statement
Let be a finite relational structure, and let denote the decision problem asking whether an input structure of the same type admits a homomorphism to .
The CSP dichotomy conjecture. For every finite relational structure , is in P or NP-complete.
This conjecture asserts that finite-domain constraint satisfaction problems have no intermediate complexity, assuming P NP. It was formulated by Feder and Vardi and is known as the CSP dichotomy conjecture.
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.