Topology and Adjunction in Promise Constraint Satisfaction-Reference-Cited by-同舟云学术

Topology and Adjunction in Promise Constraint Satisfaction

Author:

Krokhin Andrei¹^ORCID,Opršal Jakub²^ORCID,Wrochna Marcin³^ORCID,Živný Stanislav⁴^ORCID

Affiliation:

1. Department of Computer Science, Durham University, UK.

2. Institute of Science and Technology Austria, Klosterneuburg, Austria.

3. Faculty of Mathematics, Informatics, and Mechanics, Unversity of Warsaw, Poland.

4. Department of Computer Science, University of Oxford, Oxford, UK.

Funder

Horizon 2020 Framework Programme

Engineering and Physical Sciences Research Council

Royal Society

ERC

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference57 articles.

5. Dagstuhl Follow-Ups 7;Barto L.,2017

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

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

5. How Random CSPs Fool Hierarchies;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10