| No. |
Title |
Author |
Year |
| 1 |
If VNP Is Hard, Then so Are Equations for It |
Kumar, Mrinal et al. |
2022 |
| 2 |
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes |
Bhandari, Siddharth et al. |
2022 |
| 3 |
Constructing Faithful Homomorphisms over Fields of Finite Characteristic |
Chatterjee, Prerona et al. |
2019 |
| 4 |
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits |
Kumar, Mrinal et al. |
2019 |
| 5 |
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees |
Saptharishi, Ramprasad et al. |
2018 |
| 6 |
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields |
Kumar, Mrinal et al. |
2017 |
| 7 |
Finer Separations Between Shallow Arithmetic Circuits |
Kumar, Mrinal et al. |
2016 |
| 8 |
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity |
Forbes, Michael A. et al. |
2016 |
| 9 |
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs |
Anderson, Matthew et al. |
2016 |
| 10 |
On Fortification of Projection Games |
Bhangale, Amey et al. |
2015 |
| 11 |
The Power of Depth 2 Circuits over Algebras |
Saha, Chandan et al. |
2009 |
