| No. |
Title |
Author |
Year |
| 1 |
Low-Degree Testing over Grids |
Amireddy, Prashanth et al. |
2023 |
| 2 |
Towards Optimal Depth-Reductions for Algebraic Formulas |
Fournier, Hervé et al. |
2023 |
| 3 |
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials |
Limaye, Nutan et al. |
2022 |
| 4 |
On the VNP-Hardness of Some Monomial Symmetric Polynomials |
Curticapean, Radu et al. |
2022 |
| 5 |
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes |
Bhandari, Siddharth et al. |
2022 |
| 6 |
On the Probabilistic Degree of an n-Variate Boolean Function |
Srinivasan, Srikanth et al. |
2021 |
| 7 |
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't |
Chaugule, Prasad et al. |
2020 |
| 8 |
More on AC^0[oplus] and Variants of the Majority Function |
Limaye, Nutan et al. |
2019 |
| 9 |
On the Probabilistic Degrees of Symmetric Boolean Functions |
Srinivasan, Srikanth et al. |
2019 |
| 10 |
Parity Helps to Compute Majority |
Oliveira, Igor Carboni et al. |
2019 |
| 11 |
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates |
Bajpai, Swapnam et al. |
2018 |
| 12 |
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas |
Chillara, Suryajith et al. |
2018 |
| 13 |
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds |
Rajgopal, Ninad et al. |
2018 |
| 14 |
Local Decoding and Testing of Polynomials over Grids |
Srinivasan, Srikanth et al. |
2018 |
| 15 |
On the Probabilistic Degree of OR over the Reals |
Bhandari, Siddharth et al. |
2018 |
| 16 |
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications |
Chillara, Suryajith et al. |
2018 |
| 17 |
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees |
Lagarde, Guillaume et al. |
2017 |
| 18 |
On Polynomial Approximations Over Z/2^kZ* |
Bhrushundi, Abhishek et al. |
2017 |
| 19 |
Separation of AC^0[oplus] Formulas and Circuits |
Rossman, Benjamin et al. |
2017 |
| 20 |
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits |
Chen, Ruiwen et al. |
2016 |
| 21 |
On Polynomial Approximations to AC^0 |
Harsha, Prahladh et al. |
2016 |
| 22 |
Robust Multiplication-Based Tests for Reed-Muller Codes |
Harsha, Prahladh et al. |
2016 |
| 23 |
Derandomized Graph Product Results Using the Low Degree Long Code |
Dinur, Irit et al. |
2015 |
| 24 |
On Improved Degree Lower Bounds for Polynomial Approximation |
Srinivasan, Srikanth |
2013 |
| 25 |
Certifying polynomials for AC^0(parity) circuits, with applications |
Kopparty, Swastik et al. |
2012 |
| 26 |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets |
Arvind, Vikraman et al. |
2010 |
| 27 |
Arithmetic Circuits and the Hadamard Product of Polynomials |
Arvind, Vikraman et al. |
2009 |
