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}
}
  • V. Strassen
  • Published 1986
  • Mathematics, Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 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
    86 Citations

    Topics from this paper

    Universal points in the asymptotic spectrum of tensors
    • 25
    • PDF
    Powers of tensors and fast matrix multiplication
    • F. Gall
    • Mathematics, Computer Science
    • ISSAC
    • 2014
    • 897
    • PDF
    Asymptotic tensor rank of graph tensors: beyond matrix multiplication
    • 10
    • PDF
    Border rank non-additivity for higher order tensors
    • 1
    • PDF
    The asymptotic spectrum of graphs and the Shannon capacity
    • 17
    • PDF
    On the Computational Complexity of the General Discrete Fourier Transform
    • T. Beth
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 1987
    • 39
    Tensor rank is not multiplicative under the tensor product
    • 17
    • PDF
    Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes
    • 23
    • PDF

    References

    SHOWING 1-10 OF 33 REFERENCES
    Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
    • F. Romani
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1982
    • 57
    On the Asymptotic Complexity of Matrix Multiplication
    • 211
    The Complexity of Partial Derivatives
    • 295
    • PDF
    Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
    • 81
    • PDF
    Partial and Total Matrix Multiplication
    • 221
    O(n2.7799) Complexity for n*n Approximate Matrix Multiplication
    • 196
    Evaluation of Rational Functions
    • V. Strassen
    • Mathematics, Computer Science
    • Complexity of Computer Computations
    • 1972
    • 49