| 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 |
No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization |
Garg, Ankit et al. |
2021 |
| 4 |
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture |
Chattopadhyay, Arkadev et al. |
2021 |
| 5 |
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings |
Garg, Ankit et al. |
2020 |
| 6 |
Determinant Equivalence Test over Finite Fields and over Q |
Garg, Ankit et al. |
2019 |
| 7 |
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory |
Bürgisser, Peter et al. |
2018 |
| 8 |
Barriers for Rank Methods in Arithmetic Complexity |
Efremenko, Klim et al. |
2018 |
| 9 |
Separating Quantum Communication and Approximate Rank |
Anshu, Anurag et al. |
2017 |
| 10 |
Lower Bound on Expected Communication Cost of Quantum Huffman Coding |
Anshu, Anurag et al. |
2016 |
