No. Title Author Year
1 Equality Alone Does not Simulate Randomness Chattopadhyay, Arkadev et al. 2019
2 From DNF Compression to Sunflower Theorems via Regularity Lovett, Shachar et al. 2019
3 Optimality of Linear Sketching Under Modular Updates Hosseini, Kaave et al. 2019
4 Generalized Comparison Trees for Point-Location Problems Kane, Daniel M. et al. 2018
5 Hardness Amplification for Non-Commutative Arithmetic Circuits Carmosino, Marco L. et al. 2018
6 Pseudorandom Generators from Polarizing Random Walks Chattopadhyay, Eshan et al. 2018
7 Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates Chattopadhyay, Eshan et al. 2018
8 Sunflowers and Quasi-Sunflowers from Randomness Extractors Li, Xin et al. 2018
9 Torus Polynomials: An Algebraic Approach to ACC Lower Bounds Bhrushundi, Abhishek et al. 2018
10 On the Beck-Fiala Conjecture for Random Set Systems Ezra, Esther et al. 2016
11 Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem Dadush, Daniel et al. 2016
12 Large Supports are Required for Well-Supported Nash Equilibria Anbalagan, Yogesh et al. 2015
13 Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds Bhowmick, Abhishek et al. 2015
14 Lower bounds for adaptive linearity tests Lovett, Shachar 2008
Current Page :
Number of result pages: 1
Number of documents: 14


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