Fast algorithm for sparse matrix multiplication
From MaRDI portal
Publication:1172921
DOI10.1016/0020-0190(82)90114-4zbMath0502.65026OpenAlexW2116180635MaRDI QIDQ1172921
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90114-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On why an algorithmic time complexity measure can be system invariant rather than system independent ⋮ Skew-polynomial-sparse matrix multiplication ⋮ Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices ⋮ A note on a fast algorithm for sparse matrix multiplication
Cites Work
This page was built for publication: Fast algorithm for sparse matrix multiplication
