Affiliation:
1. McMaster University and Charles University in Prague
2. Jagiellonian University
Abstract
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].
Funder
Grant Agency of the Czech Republic
Ministry of Education, Youth and Sports
Narodowe Centrum Nauki
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures;Journal of the ACM;2024-08-17
2. Local consistency as a reduction between constraint satisfaction problems;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Quantum advantage and CSP complexity;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
4. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
5. A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory;ACM Transactions on Computation Theory;2024-06-10