No. Title Author Year
1 On Polynomial Approximations Over Z/2^kZ* Bhrushundi, Abhishek et al. 2017
2 Separation of AC^0[oplus] Formulas and Circuits Rossman, Benjamin et al. 2017
3 Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits Chen, Ruiwen et al. 2016
4 On Polynomial Approximations to AC^0 Harsha, Prahladh et al. 2016
5 Robust Multiplication-Based Tests for Reed-Muller Codes Harsha, Prahladh et al. 2016
6 Derandomized Graph Product Results Using the Low Degree Long Code Dinur, Irit et al. 2015
7 On Improved Degree Lower Bounds for Polynomial Approximation Srinivasan, Srikanth 2013
8 Certifying polynomials for AC^0(parity) circuits, with applications Kopparty, Swastik et al. 2012
9 The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets Arvind, Vikraman et al. 2010
10 Arithmetic Circuits and the Hadamard Product of Polynomials Arvind, Vikraman et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI