1. Finitely tractable promise constraint satisfaction problems;Asimi,2021
2. Promise constraint satisfaction and width;Atserias,2022
3. Improved inapproximability of rainbow coloring;Austrin,2020
4. (2+ϵ)-Sat is NP-hard;Austrin;SIAM J. Comput.,2017
5. Symmetric promise constraint satisfaction problems: beyond the Boolean case;Barto,2021