Yan Li

Generating author description...

All published works

Action	Title	Year	Authors
+	An Introduction to the Computational Complexity of Matrix Multiplication	2019	Yan Li Shenglong Hu Jie Wang Zheng‐Hai Huang

Common Coauthors

Coauthor	Papers Together
Shenglong Hu	1
Zheng‐Hai Huang	1
Jie Wang	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A 5/2n/sup 2/-lower bound for the rank of n×n-matrix multiplication over arbitrary fields	2003	Markus Bläser	1
+ PDF Chat	The border rank of the multiplication of $2\times 2$ matrices is seven	2005	J. M. Landsberg	1
+	The rank of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:mi>n</mml:mi><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math>matrix multiplication is at least<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" overflow="scroll"><mml:mrow><mml:mn>3</mml:mn><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mn>2</mml:mn><mml:msqrt><mml:mrow><…	2013	Alex Massarenti Emanuele Raviolo	1
+	On the complexity of some algorithms of matrix multiplication	1985	V. B. ALEKSEYEV	1
+	Matrix multiplication via arithmetic progressions	1990	Don Coppersmith S. Winograd	1
+	On the complexity of the multiplication of matrices of small formats	2003	Markus Bläser	1
+ PDF Chat	On Minimizing the Number of Multiplications Necessary for Matrix Multiplication	1971	John E. Hopcroft Lígia Regina Franco Sansigolo Kerr	1
+	O(n2.7799) complexity for n × n approximate matrix multiplication	1979	Dario A. Bini Milvio Capovani Francesco Romani G. Lotti	1
+	A note on border rank	1984	Thomas Lickteig	1
+	Relations between exact and approximate bilinear algorithms. Applications	1980	Dario A. Bini	1
+	Lower bounds for the multiplicative complexity of matrix multiplication	1999	Markus Bläser	1
+	The bilinear complexity and practical algorithms for matrix multiplication	2013	А. В. Смирнов	1
+ PDF Chat	A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications	1976	Julian D. Laderman	1
+	Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication	1982	Francesco Romani	1
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	1
+ PDF Chat	Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms	1973	John E. Hopcroft Jean E. Musinski	1
+	Typical tensorial rank	1985	Thomas Lickteig	1
+	The asymptotic spectrum of tensors and the exponent of matrix multiplication	1986	Volker Strassen	1
+	On the complexity of computing bilinear forms with {0, 1} constants	1980	Teofilo F. Gonzalez Joseph F. JáJá	1
+	On multiplication of 2 × 2 matrices	1971	S. Winograd	1
+	Rank and optimal computation of generic tensors	1983	Volker Strassen	1
+	Tensors: Geometry and Applications	2011	J. M. Landsberg	1
+	Tensor rank is NP-complete	1990	Johan Håstad	1
+ PDF Chat	Powers of tensors and fast matrix multiplication	2014	François Le Gall	1
+ PDF Chat	Group-theoretic Algorithms for Matrix Multiplication	2005	Henry Cohn Robert Kleinberg Balázs Szegedy Chris Umans	1
+	Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations	1978	Victor Y. Pan	1
+ PDF Chat	On sunflowers and matrix multiplication	2013	Noga Alon Amir Shpilka Christopher Umans	1
+ PDF Chat	A $2{\mathbf{n}}^2-{\text{log}}_2({\mathbf{n}})-1$ lower bound for the border rank of matrix multiplication	2017	J. M. Landsberg Mateusz Michałek	1
+	ALGEBRAIC COMPLEXITY THEORY (Grundlehren der Mathematischen Wissenschaften 315)	1999	K. Kalorkoti	1
+ PDF Chat	On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry	2017	J. M. Landsberg Mateusz Michałek	1
+ PDF Chat	None	2015	J. M. Landsberg Giorgio Ottaviani	1
+ PDF Chat	New Lower Bounds for the Rank of Matrix Multiplication	2014	J. M. Landsberg	1
+	Rank and optimal computation of generic tensors	1983	V Strassen	1