Complexity measures for matrix multiplication algorithms

DOI10.1007/BF02575864MaRDI QIDQ1152202zbMATH OpenOpenAlexFDO

Authors 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

computational complexitystabilitymatrix 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)

Cites work

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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152202)