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 |
Determinant Equivalence Test over Finite Fields and over Q |
Garg, Ankit et al. |
2019 |

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

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

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

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

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

9 |
Arithmetic Circuit Complexity (Tutorial) |
Kayal, Neeraj |
2014 |