Answers are grounded in this paper and cite their sources.
This column gives a brief survey of current research on the complexity of the constraint satisfaction problem (CSP) over fixed constraint languages.
No takes yet. Share an insight, caveat, or question.
Libor Barto (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: