The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
From MaRDI portal
Publication:3557017
DOI10.1007/978-3-642-12200-2_14zbMath1283.68163MaRDI QIDQ3557017
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_14
65F50: Computational methods for sparse matrices
68Q25: Analysis of algorithms and problem complexity
Related Items