O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION

[1] Borodin, Munro, The Computational Complexity of Algebraic and Numeric Problems, (1975)

[2] Hopcroft, Musinski, Duality applied to the complexity of matrix multiplication and other bilinear forms, SIAM Journal on Computing, 2, pp. 159-173, (1973)

[3] Ya. Pan, Strassen algorithm is not optimal, Proc. IEEE 19th Annual Symposium on Foundations of Computer Science, (1978)

[4] Strassen, Gaussian elimination is not optimal, Numer. Math., 13, pp. 351-356, (1969)

[1] Borodin, Munro, The Computational Complexity of Algebraic and Numeric Problems, (1975)

[2] Hopcroft, Musinski, Duality applied to the complexity of matrix multiplication and other bilinear forms, SIAM Journal on Computing, 2, pp. 159-173, (1973)

[3] Ya. Pan, Strassen algorithm is not optimal, Proc. IEEE 19th Annual Symposium on Foundations of Computer Science, (1978)

[4] Strassen, Gaussian elimination is not optimal, Numer. Math., 13, pp. 351-356, (1969)