On optimizing multiplications of sparse matrices

DOI10.1007/3-540-61310-2_17zbMath1416.65123OpenAlexW1506547947MaRDI QIDQ4645925

Edith Cohen

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_17

zbMATH Keywords

estimation algorithmchain productcolumn sizenonzero entrysparse matrice

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items

Size-estimation framework with applications to transitive closure and reachability

Cites Work

• Matrix multiplication via arithmetic progressions
• Gaussian elimination is not optimal
• Sparse matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item