General asymptotic rank speedup theorems are established via Strassen calculus, proving the asymptotic rank of cw_2 is below 3.931 and yielding an upper bound below d^{2ω/3} for any d×d×d tensor.
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asymptotic Rank Speedup Theorems, Revisited
General asymptotic rank speedup theorems are established via Strassen calculus, proving the asymptotic rank of cw_2 is below 3.931 and yielding an upper bound below d^{2ω/3} for any d×d×d tensor.