Bini, Dario; Capovani, Milvio; Romani, Francesco; Lotti, Grazia \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication. (English) Zbl 0395.68048 Inf. Process. Lett. 8, 234-235 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 62 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 65F30 Other matrix algorithms (MSC2010) Keywords:Approximate Matrix Multiplication; Computational; Complexity PDFBibTeX XMLCite \textit{D. Bini} et al., Inf. Process. Lett. 8, 234--235 (1979; Zbl 0395.68048) Full Text: DOI References: [1] Borodin, A.; Munro, I., The Computational Complexity of Algebraic and Numeric Problems (1975), American Elsevier: American Elsevier New York · Zbl 0404.68049 [2] Hopcroft, J.; Musinski, J., Duality applied to the complexity of matrix multiplication and other bilinear forms, SIAM J. Comput., 2, 159-173 (1973) · Zbl 0294.65022 [3] Ya. Pan, V., Strassen algorithm is not optimal, Proc. IEEE 19th Annual Symposium on Foundations of Computer Science (1978), to appear. [4] Strassen, V., Gaussian elimination is not optimal, Numer. Math., 13, 351-356 (1969) · Zbl 0185.40101 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.