No. Title Author Year
1 No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization Garg, Ankit et al. 2021
2 Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture Chattopadhyay, Arkadev et al. 2021
3 Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings Garg, Ankit et al. 2020
4 Determinant Equivalence Test over Finite Fields and over Q Garg, Ankit et al. 2019
5 Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory B├╝rgisser, Peter et al. 2018
6 Barriers for Rank Methods in Arithmetic Complexity Efremenko, Klim et al. 2018
7 Separating Quantum Communication and Approximate Rank Anshu, Anurag et al. 2017
8 Lower Bound on Expected Communication Cost of Quantum Huffman Coding Anshu, Anurag et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI