Answers are grounded in this paper and cite their sources.
We prove that constraint satisfaction problems without the ability to count are solvable by the local consistency checking algorithm. This settles three (equivalent) conjectures: Feder--Vardi [SICOMP’98], Bulatov [LICS’04] and Larose--Zádori [AU’07].
No takes yet. Share an insight, caveat, or question.
Barto et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: