Author:
Cohn Henry,Umans Christopher
Publisher
Society for Industrial and Applied Mathematics
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Faster Matrix Multiplication via Asymmetric Hashing;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Generalizations of Matrix Multiplication can solve the Light Bulb Problem;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. On Matrix Multiplication and Polynomial Identity Testing;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method;Foundations of Computational Mathematics;2016-09-26