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

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