No. Title Author Year
1 Quantum Versus Randomized Communication Complexity, with Efficient Players Girish, Uma et al. 2021
2 Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract) Filmus, Yuval et al. 2021
3 AC^0[p] Lower Bounds Against MCSP via the Coin Problem Golovnev, Alexander et al. 2019
4 On the Computational Power of Radio Channels Braverman, Mark et al. 2019
5 Time-Space Lower Bounds for Two-Pass Learning Garg, Sumegha et al. 2019
6 Cubic Formula Size Lower Bounds Based on Compositions with Majority Gál, Anna et al. 2018
7 Pseudorandom Generators for Low Sensitivity Functions Hatami, Pooya et al. 2018
8 Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates Chattopadhyay, Eshan et al. 2018
9 Low-Sensitivity Functions from Unambiguous Certificates Ben-David, Shalev et al. 2017
10 Lower Bounds for 2-Query LCCs over Large Alphabet Bhattacharyya, Arnab et al. 2017
11 Tight Bounds on the Fourier Spectrum of AC0 Tal, Avishay 2017
12 On the Sensitivity Conjecture Tal, Avishay 2016
13 Two Structural Results for Low Degree Polynomials and Applications Cohen, Gil et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 13


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