No. Title Author Year
1 Local Decoding and Testing of Polynomials over Grids Srinivasan, Srikanth et al. 2018
2 Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications Chillara, Suryajith et al. 2018
3 Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees Lagarde, Guillaume et al. 2017
4 On Polynomial Approximations Over Z/2^kZ* Bhrushundi, Abhishek et al. 2017
5 Separation of AC^0[oplus] Formulas and Circuits Rossman, Benjamin et al. 2017
6 Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits Chen, Ruiwen et al. 2016
7 On Polynomial Approximations to AC^0 Harsha, Prahladh et al. 2016
8 Robust Multiplication-Based Tests for Reed-Muller Codes Harsha, Prahladh et al. 2016
9 Derandomized Graph Product Results Using the Low Degree Long Code Dinur, Irit et al. 2015
10 On Improved Degree Lower Bounds for Polynomial Approximation Srinivasan, Srikanth 2013
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint Published by LZI