Algebraic approach to promise constraint satisfaction-Reference-Cited by-同舟云学术

Algebraic approach to promise constraint satisfaction

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bulín Jakub¹,Krokhin Andrei²,Opršal Jakub²

Affiliation:

1. Charles University in Prague, Czechia

2. University of Durham, UK

Funder

Grantová Agentura ðeské Republiky

European Research Council

Engineering and Physical Sciences Research Council

Univerzita Karlova v Praze

Austrian Science Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316300

Reference63 articles.

1. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

2. Per Austrin Amey Bhangale and Aditya Potukuchi. 2018. Improved Inapproximability of Rainbow Coloring. ArXiv e-prints (Oct. 2018). arXiv: 1810.02784 Per Austrin Amey Bhangale and Aditya Potukuchi. 2018. Improved Inapproximability of Rainbow Coloring. ArXiv e-prints (Oct. 2018). arXiv: 1810.02784

3. $(2+\varepsilon)$-Sat Is NP-hard

4. Libor Barto. 2019. Promises make finite (constraint satisfaction) problems infinitary. (2019). Libor Barto. 2019. Promises make finite (constraint satisfaction) problems infinitary. (2019).

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

1. Relational Characterization of Multilevel Threshold Functions;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28

2. Optimal Inapproximability with Universal Factor Graphs;ACM Transactions on Algorithms;2023-12-15

3. Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs;Algorithmica;2023-03-27

4. Topology and Adjunction in Promise Constraint Satisfaction;SIAM Journal on Computing;2023-02-14

5. Balancing Academic Curriculum Problem Solution: A Discrete Firefly-Based Approach;Education Research International;2023-02-09