The asymptotic spectrum of tensors and the exponent of matrix multiplication
@article{Strassen1986TheAS, title={The asymptotic spectrum of tensors and the exponent of matrix multiplication}, author={V. Strassen}, journal={27th Annual Symposium on Foundations of Computer Science (sfcs 1986)}, year={1986}, pages={49-54} }
We introduce an asymptotic data structure for the relative bilinear complexity of bilinear maps (tensors). It consists of a compact Hausdorff space Δ together with an interpretation of the tensors under consideration as continuous functions on Δ. The asymptotic rank of a tensor is simply the maximum of the associated function. On the way we present a new method for estimating the exponent ω of matrix multiplication, leading at present to the bound ω ≪ 2.48. The paper gives only brief… CONTINUE READING
Topics from this paper
Paper Mentions
86 Citations
Asymptotic tensor rank of graph tensors: beyond matrix multiplication
- Mathematics, Computer Science
- computational complexity
- 2018
- 10
- PDF
The asymptotic spectrum of graphs and the Shannon capacity
- Mathematics, Computer Science
- Comb.
- 2019
- 17
- PDF
On the Computational Complexity of the General Discrete Fourier Transform
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1987
- 39
Tensor rank is not multiplicative under the tensor product
- Mathematics, Computer Science
- ArXiv
- 2017
- 17
- PDF
Towards a geometric approach to Strassen’s asymptotic rank conjecture
- Mathematics, Computer Science
- 2018
- 1
- PDF
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes
- Mathematics, Computer Science
- 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
- 2018
- 23
- PDF
References
SHOWING 1-10 OF 33 REFERENCES
Fast rectangular matrix multiplication (algebraic computational, asymptotic complexity)
- Mathematics
- 1985
- 2
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- Mathematics, Computer Science
- SIAM J. Comput.
- 1982
- 57
On the Asymptotic Complexity of Matrix Multiplication
- Mathematics, Computer Science
- SIAM J. Comput.
- 1982
- 211
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Mathematics, Computer Science
- SIAM J. Comput.
- 1973
- 81
- PDF
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication
- Mathematics, Computer Science
- Inf. Process. Lett.
- 1979
- 196
Evaluation of Rational Functions
- Mathematics, Computer Science
- Complexity of Computer Computations
- 1972
- 49