O(n2.7799) complexity for n × n approximate matrix multiplication

Information Processing Letters

Volumn 8, Issue 5, 1979, Pages 234-235

  Bini, Dario ^a   Capovani, Milvio ^b   Romani, Francesco ^b   Lotti, Grazia ^a  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

Author keywords

Analysis of algorithms; computational complexity; numerical mathematics

Indexed keywords

EID: 0038954994     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(79)90113-3     Document Type: Article

References (4)

1. Duality applied to the complexity of matrix multiplication and other bilinear forms
2. Strassen algorithm is not optimal
3. Gaussian elimination is not optimal