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.
Journal of Symbolic Computation9(3), 251–280 (1990)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Exploits special structural features in tensor decompositions to lower the matrix multiplication exponent for 6x6 matrices from 2.8075 to 2.8019.
A typed imperative language whose programs are exactly the polynomial-time computable functions.
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.
-
Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
Exploits special structural features in tensor decompositions to lower the matrix multiplication exponent for 6x6 matrices from 2.8075 to 2.8019.
-
A Programming Language for Feasible Solutions
A typed imperative language whose programs are exactly the polynomial-time computable functions.