This article introduces the approach on studying the computational complexity of matrix multiplication by ranks of the matrix multiplication tensors.Basic results and recent developments in this area are reviewed.
基金This work was partially supported by the National Natural Science Foundation of China(Nos.11431002,11771328,11871051)Young Elite Scientists Sponsorship Program by Tianjin,the Natural Science Foundation of Zhejiang Province(No.LD19A010002)Innovation Research Foundation of Tianjin University(No.2017XRG-0015).
文摘This article introduces the approach on studying the computational complexity of matrix multiplication by ranks of the matrix multiplication tensors.Basic results and recent developments in this area are reviewed.
