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
95 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Formal Grounds for Construction for Intellimedia Automated System;2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS);2023-09-07
2. Approximate Graph Colouring and the Hollow Shadow;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. SDPs and Robust Satisfiability of Promise CSP;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. The smallest hard trees;Constraints;2023-03-25
5. CLAP: A New Algorithm for Promise CSPs;SIAM Journal on Computing;2023-01-25