Non-uniqueness of Strassen’s Sub-cubic Matrix Multiplication Formula

Jacob Adopley

Abstract


An alternative expression for Strassen’s matrix multiplicaton for-
mula is derived to show that, the original expressions for the formula
is not unique.

Full Text:

PDF

References


Cohn, H; Kleinberg, R: Szegedy, B and Umans, C. Group-theoretic al-

gorithms for matrix multiplication. 46th Annual IEEE Symposium on

Foundations of Computer Science, (FOCS 2005). p 379, 1970.

Coppersmith, Don and Winograd, Shmuel. Matrix multiplication via

arithmetic progressions. Journal of Symbolic Computation 9 (3): 251,

Vol. 20, 1-24, 1990.

Davie, A. M. and Stothers, A. J. Improved bound for matrix multiplica-

tion. Proceedings of the Royal Society of Edinburg 143A, 351-370, 2013.

Le Gall, Francois. Power of Tensors and fast matrix multiplication. Pro-

ceedinds of the 39th International Symposium on Symbolic and Algebraic

Computation(ISSAC, 2014.

Robinson, Sara. Towards an optimal algorithm for matrix mutiplication.

SIAM News 38 (9), 2005.

Stothers, Andrew. On the Complexity of Matrix Multiplication. 2010.

Thesis.

Williams, Virginia. Breaking the coppersmith-winograd barrier. 2011.


Refbacks

  • There are currently no refbacks.


Copyright (c)