| On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials | 0 | 0.34 | 2022 |
| Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes | 0 | 0.34 | 2022 |
| A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates | 0 | 0.34 | 2022 |
| On the Probabilistic Degree of an n-Variate Boolean Function. | 0 | 0.34 | 2021 |
| A Fixed-Depth Size-Hierarchy Theorem For Ac(0)[Circle Plus] Via The Coin Problem | 0 | 0.34 | 2021 |
| On The Probabilistic Degrees Of Symmetric Boolean Functions | 0 | 0.34 | 2021 |
| A robust version of Hegedus’s lemma, with applications | 0 | 0.34 | 2020 |
| Decoding Variants of Reed-Muller Codes over Finite Grids | 0 | 0.34 | 2020 |
| More on $AC^0[oplus]$ and Variants of the Majority Function. | 0 | 0.34 | 2019 |
| A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem | 0 | 0.34 | 2019 |
| Schur Polynomials do not have small formulas if the Determinant doesn't! | 0 | 0.34 | 2019 |
| On the Probabilistic Degrees of Symmetric Boolean Functions. | 0 | 0.34 | 2019 |
| Decoding Downset codes over a finite grid. | 0 | 0.34 | 2019 |
| More on AC0[oplus] and Variants of the Majority Function. | 0 | 0.34 | 2019 |
| Parity helps to compute Majority. | 0 | 0.34 | 2019 |
| Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. | 0 | 0.34 | 2018 |
| A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. | 0 | 0.34 | 2018 |
| The Coin Problem in Constant Depth: Sample Complexity and Parity gates. | 1 | 0.35 | 2018 |
| A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits | 0 | 0.34 | 2018 |
| On the Probabilistic Degree of OR over the Reals. | 0 | 0.34 | 2018 |
| Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. | 0 | 0.34 | 2017 |
| On polynomial approximations over Z/2kZ. | 0 | 0.34 | 2017 |
| The shifted partial derivative complexity of Elementary Symmetric Polynomials. | 1 | 0.38 | 2017 |
| On polynomial approximations over ℤ/2kℤ. | 0 | 0.34 | 2017 |
| On Some Recent Projection Switching Lemmas for Small Depth Circuits. | 0 | 0.34 | 2017 |
| On Polynomial Approximations to $\mathrm{AC}^0$. | 0 | 0.34 | 2016 |
| Lower bounds for non-commutative skew circuits. | 0 | 0.34 | 2016 |
| On Polynomial Approximations to ${AC}^0$. | 3 | 0.40 | 2016 |
| An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. | 0 | 0.34 | 2016 |
| A Compression Algorithm for $AC^0[\oplus]$ circuits using Certifying Polynomials. | 0 | 0.34 | 2015 |
| Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication | 16 | 0.64 | 2015 |
| An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas | 21 | 0.75 | 2014 |
| Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas | 9 | 0.54 | 2014 |
| Derandomized Graph Product Results Using the Low Degree Long Code. | 0 | 0.34 | 2014 |
| On Improved Degree Lower Bounds for Polynomial Approximation. | 2 | 0.38 | 2013 |
| Lower bounds for depth 4 formulas computing iterated matrix multiplication | 4 | 0.41 | 2013 |
| Composition limits and separating examples for some Boolean function complexity measures. | 3 | 0.40 | 2013 |
| On the limits of sparsification | 7 | 0.55 | 2012 |
| Optimal Hitting Sets for Combinatorial Shapes | 2 | 0.38 | 2012 |
| Pseudorandom Generators for Read-Once ACC^0 | 1 | 0.38 | 2012 |
| A Tail Bound for Read-k Families of Functions | 9 | 0.83 | 2012 |
| Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ circuits, with applications. | 0 | 0.34 | 2012 |
| Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT | 2 | 0.37 | 2012 |
| Certifying polynomials for AC^0(parity) circuits, with applications. | 5 | 0.44 | 2012 |
| Streaming algorithms for recognizing nearly well-parenthesized expressions | 4 | 0.38 | 2011 |
| Almost settling the hardness of noncommutative determinant | 5 | 0.58 | 2011 |
| Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. | 0 | 0.34 | 2011 |
| New Results on Noncommutative and Commutative Polynomial Identity Testing | 17 | 0.66 | 2010 |
| The Remote Point Problem, Small Bias Space, and Expanding Generator Sets | 3 | 0.42 | 2009 |
| Circuit Lower Bounds, Help Functions, and the Remote Point Problem | 0 | 0.34 | 2009 |
