The dichotomy conjecture for constraint satisfaction problems of reducts
Statement
Let be a finitely bounded homogeneous structure, and let be a finite-language reduct of . The constraint satisfaction problem of is denoted by .
Dichotomy conjecture. is either in P or NP-complete.
Complete classifications with this dichotomy were known for the empty structure, the rationals with their usual order, and the random graph. The conjecture proposes that the same P-versus-NP-complete classification holds for every finite-language reduct of a finitely bounded homogeneous structure; membership in NP is already known in this setting.
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.