Affiliation:
1. Durham University, UK
2. Institute of Science and Technology Austria
Abstract
The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,General Environmental Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. 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
3. Boolean symmetric vs. functional PCSP dichotomy;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Approximate Graph Colouring and the Hollow Shadow;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02