Complexity measures for matrix multiplication algorithms

DOI10.1007/BF02575864zbMath0459.65027OpenAlexW1993258999MaRDI QIDQ1152202

Francesco Romani

Publication date: 1980

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575864

zbMATH Keywords

stabilitycomputational complexitymatrix multiplicationAPA-algorithmsasymptotical complexity measurescomputation of bilinear formsEC-algorithmsECD-algorithmsfixed precision

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63)

Related Items (3)

The bit-cost of some algorithms for the solution of linear systems ⋮ Shortest-path problem is not harder than matrix multiplication ⋮ The bit-operation complexity of matrix multiplication and of all pair shortest path problem

Cites Work

• Relations between exact and approximate bilinear algorithms. Applications
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• Fast multiplication of large numbers
• Approximate Solutions for the Bilinear Form Computational Problem

This page was built for publication: Complexity measures for matrix multiplication algorithms