Cited By
View all- Austrin PBrown-Cohen JHåstad JMarx D(2021)Optimal inapproximability with universal factor graphsProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458091(434-453)Online publication date: 10-Jan-2021
- Viola CŽivný S(2021)The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite DomainsACM Transactions on Algorithms10.1145/345804117:3(1-23)Online publication date: 15-Jul-2021
- Barto LBulín JKrokhin AOpršal J(2021)Algebraic Approach to Promise Constraint SatisfactionJournal of the ACM10.1145/345760668:4(1-66)Online publication date: 14-Jul-2021
- Show More Cited By