No. Title Author Year
1 On Rich 2-to-1 Games Braverman, Mark et al. 2021
2 Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality Kelman, Esty et al. 2021
3 Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut Bhangale, Amey et al. 2020
4 Improved 3LIN Hardness via Linear Label Cover Harsha, Prahladh et al. 2019
5 UG-Hardness to NP-Hardness by Losing Half Bhangale, Amey et al. 2019
6 An Improved Dictatorship Test with Perfect Completeness Bhangale, Amey et al. 2018
7 An ~O(n) Queries Adaptive Tester for Unateness Khot, Subhash et al. 2016
8 Hardness of Approximation (Invited Talk) Khot, Subhash 2016
9 Hardness of Bipartite Expansion Khot, Subhash et al. 2016
10 On Approximation Resistance of Predicates (Invited Talk) Khot, Subhash 2013
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI