The Input/Output Complexity of Sparse Matrix Multiplication

DOI10.1007/978-3-662-44777-2_62zbMath1425.68147arXiv1403.3551OpenAlexW1525570549MaRDI QIDQ2921459

Morten Stöckel, Rasmus Pagh

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Fast Output-Sensitive Matrix Multiplication ⋮ Unnamed Item ⋮ Turing machines with two-level memory: a deep look into the input/output complexity ⋮ Turing machines with two-level memory: new computational models for analyzing the input/output complexity

This page was built for publication: The Input/Output Complexity of Sparse Matrix Multiplication