Login / Signup
The Time Complexity of Fully Sparse Matrix Multiplication.
Amir Abboud
Karl Bringmann
Nick Fischer
Marvin Künnemann
Published in:
SODA (2024)
Keyphrases
</>
matrix multiplication
computational complexity
distributed memory
high dimensional
message passing
worst case
sparse data
sparse sampling
case study
pairwise
data management
space complexity