Cited By
View all- Brakensiek JGuruswami VSandeep SSaha BServedio R(2023)SDPs and Robust Satisfiability of Promise CSPProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585180(609-622)Online publication date: 2-Jun-2023
- Brakensiek JGuruswami V(2021)The Quest for Strong Inapproximability Results with Perfect CompletenessACM Transactions on Algorithms10.1145/345966817:3(1-35)Online publication date: 15-Jul-2021
- Dalmau VKozik MKrokhin AMakarychev KMakarychev YOpršal J(2019)Robust Algorithms with Polynomial Loss for Near-Unanimity CSPsSIAM Journal on Computing10.1137/18M116393248:6(1763-1795)Online publication date: 26-Nov-2019
- Show More Cited By