scientific article; zbMATH DE number 7650266

DOI10.4230/LIPICS.ISAAC.2019.33MaRDI QIDQ5875595zbMATH OpenFDO

Authors Lorenzo De Stefani

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1904.12804

zbMATH Keywords

hybrid algorithmI/O complexitymatrix multiplicationrecomputation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• The I/O complexity of Strassen's matrix multiplication with recomputation
• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
• Publication:4944595
• On the complexity of some algorithms of matrix multiplication
• scientific article; zbMATH DE number 151736
• The input/output complexity of sparse matrix multiplication
• On the complexity of integer matrix multiplication
• Fast hybrid matrix multiplication algorithms
• O(n) matrix multiplication algorithm for hypercube machines
• The bilinear complexity and practical algorithms for matrix multiplication

Cited in

(2)

• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
• N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm

This page was built for publication:

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