Author:
Cohn H.,Kleinberg R.,Szegedy B.,Umans C.
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication;Lecture Notes in Computer Science;2023-12-09
3. Faster Matrix Multiplication via Asymmetric Hashing;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity;2023 13th International Conference on Advanced Computer Information Technologies (ACIT);2023-09-21
5. On Matrix Multiplication and Polynomial Identity Testing;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10