No. Title Author Year
1 Improved 3LIN Hardness via Linear Label Cover Harsha, Prahladh et al. 2019
2 Boolean Function Analysis on High-Dimensional Expanders Dikstein, Yotam et al. 2018
3 From Local to Robust Testing via Agreement Testing Dinur, Irit et al. 2018
4 On the Probabilistic Degree of OR over the Reals Bhandari, Siddharth et al. 2018
5 Multiplayer Parallel Repetition for Expanding Games Dinur, Irit et al. 2017
6 On Polynomial Approximations Over Z/2^kZ* Bhrushundi, Abhishek et al. 2017
7 Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1 Deshpande, Amit et al. 2016
8 On Polynomial Approximations to AC^0 Harsha, Prahladh et al. 2016
9 Partition Bound Is Quadratically Tight for Product Distributions Harsha, Prahladh et al. 2016
10 Robust Multiplication-Based Tests for Reed-Muller Codes Harsha, Prahladh et al. 2016
11 A Characterization of Hard-to-cover CSPs Bhangale, Amey et al. 2015
12 Derandomized Graph Product Results Using the Low Degree Long Code Dinur, Irit et al. 2015
13 Front Matter, Table of Contents, Preface, Conference Organization Harsha, Prahladh et al. 2015
14 A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound Harsha, Prahladh et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 14


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