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

1 |
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization |
Amireddy, Prashanth et al. |
2023 |

2 |
Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case |
Bhargava, Vishwas et al. |
2022 |

3 |
Hitting Sets for Orbits of Circuit Classes and Polynomial Families |
Saha, Chandan et al. |
2021 |

4 |
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits |
Gupta, Nikhil et al. |
2020 |

5 |
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests |
Murthy, Janaky et al. |
2020 |

6 |
Determinant Equivalence Test over Finite Fields and over Q |
Garg, Ankit et al. |
2019 |

7 |
On the Symmetries of and Equivalence Test for Design Polynomials |
Gupta, Nikhil et al. |
2019 |

8 |
Reconstruction of Full Rank Algebraic Branching Programs |
Kayal, Neeraj et al. |
2017 |

9 |
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits |
Kayal, Neeraj et al. |
2016 |

10 |
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits |
Kayal, Neeraj et al. |
2016 |

11 |
Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin |
Kayal, Neeraj et al. |
2015 |

12 |
Multi-k-ic Depth Three Circuit Lower Bound |
Kayal, Neeraj et al. |
2015 |

13 |
The Power of Depth 2 Circuits over Algebras |
Saha, Chandan et al. |
2009 |

14 |
Factoring Polynomials over Finite Fields using Balance Test |
Saha, Chandan |
2008 |