No. |
Title |
Author |
Year |
---|

1 |
If VNP Is Hard, Then so Are Equations for It |
Kumar, Mrinal et al. |
2022 |

2 |
A Lower Bound on Determinantal Complexity |
Kumar, Mrinal et al. |
2021 |

3 |
A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits |
Kumar, Mrinal et al. |
2021 |

4 |
Ideal-Theoretic Explanation of Capacity-Achieving Decoding |
Bhandari, Siddharth et al. |
2021 |

5 |
A Quadratic Lower Bound for Algebraic Branching Programs |
Chatterjee, Prerona et al. |
2020 |

6 |
Lower Bounds for Matrix Factorization |
Kumar, Mrinal et al. |
2020 |

7 |
On Multilinear Forms: Bias, Correlation, and Tensor Rank |
Bhrushundi, Abhishek et al. |
2020 |

8 |
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't |
Chaugule, Prasad et al. |
2020 |

9 |
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits |
Kumar, Mrinal et al. |
2019 |

10 |
Hardness vs Randomness for Bounded Depth Arithmetic Circuits |
Chou, Chi-Ning et al. |
2018 |

11 |
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits |
Alon, Noga et al. |
2018 |

12 |
A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs |
Kumar, Mrinal |
2017 |

13 |
An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields |
Kumar, Mrinal et al. |
2017 |

14 |
Arithmetic Circuits with Locally Low Algebraic Rank |
Kumar, Mrinal et al. |
2016 |

15 |
Finer Separations Between Shallow Arithmetic Circuits |
Kumar, Mrinal et al. |
2016 |

16 |
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity |
Forbes, Michael A. et al. |
2016 |

17 |
Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing |
Kumar, Mrinal et al. |
2016 |