No. Title Author Year
1 Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number Guruswami, Venkatesan et al. 2022
2 A Stress-Free Sum-Of-Squares Lower Bound for Coloring Kothari, Pravesh K. et al. 2021
3 Memory-Sample Lower Bounds for Learning Parity with Noise Garg, Sumegha et al. 2021
4 Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG Garg, Sumegha et al. 2020
5 Improper Learning by Refuting Kothari, Pravesh K. et al. 2018
6 Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture Barak, Boaz et al. 2018
7 SOS Lower Bounds with Hard Constraints: Think Global, Act Local Kothari, Pravesh K. et al. 2018
8 Embedding Hard Learning Problems Into Gaussian Space Klivans, Adam et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 8

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