Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2014)
Powers of tensors and fast matrix multiplication
J. Stoer (1989)
Numerische Mathematik 1
{id, π})) and χ represents χ(S 8 abc , {id, π}), where π is defined in Lemma 5.1. (a, b, c) d χ lower bound onQ (a, b, c) V ρ (u ⊗8 (a, b, c)) (16,0,0
N. Alon, Amir Shpilka, C. Umans (2012)
On sunflowers and matrix multiplicationcomputational complexity, 22
Henry Cohn, C. Umans (2012)
Fast matrix multiplication using coherent configurations
Henry Cohn, Robert Kleinberg, Balázs Szegedy, C. Umans (2005)
Group-theoretic algorithms for matrix multiplication46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
M. Bläser (2013)
Fast Matrix MultiplicationTheory Comput., 5
A. Davie, A. Stothers (2013)
Improved bound for complexity of matrix multiplicationProceedings of the Royal Society of Edinburgh: Section A Mathematics, 143
S. Fang, J. Tsao (2009)
Entropy Optimization: Interior Point Methods
J. Landsberg (2011)
The complexity of matrix multiplication
A. Stothers (2010)
On the complexity of matrix multiplication
V. Williams (2012)
Multiplying matrices faster than coppersmith-winograd
F. Romani (1982)
Some Properties of Disjoint Sums of Tensors Related to Matrix MultiplicationSIAM J. Comput., 11
F. Gall (2012)
Faster Algorithms for Rectangular Matrix Multiplication2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
A. Ben-Tal (1987)
Lectures on modern convex optimization
Dario Bini, M. Capovani, F. Romani, G. Lotti (1979)
O(n2.7799) Complexity for n*n Approximate Matrix MultiplicationInf. Process. Lett., 8
D. Coppersmith, S. Winograd (1987)
Matrix multiplication via arithmetic progressionsProceedings of the nineteenth annual ACM symposium on Theory of computing
V. Strassen (1986)
The asymptotic spectrum of tensors and the exponent of matrix multiplication27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
18] http://francoislegall.com/MatrixMultiplication/programs.zip
Values of the components and optimal probability distributions for u ⊗4 , computed with Algorithm A for ρ = 2.44303 and q = 3
V. Strassen (1969)
Gaussian elimination is not optimalNumerische Mathematik, 13
V. Strassen (1991)
Algebraic Complexity Theory
D. Coppersmith, S. Winograd (1981)
On the asymptotic complexity of matrix multiplication22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
V. Pan (1979)
Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
Stephen Boyd, L. Vandenberghe (2005)
Convex OptimizationJournal of the American Statistical Association, 100
A. Ben-Tal, Arkadiaei Nemirovskiaei (2001)
Lectures on modern convex optimization - analysis, algorithms, and engineering applications
V. Pan (1981)
New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics With Applications, 7
A. Schönhage (1981)
Partial and Total Matrix MultiplicationSIAM J. Comput., 10
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation – Unpaywall
Published: Jul 23, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.