Fast Output-Sensitive Matrix Multiplication

DOI10.1007/978-3-662-48350-3_64zbMath1466.68082OpenAlexW2404014258MaRDI QIDQ3452839

Riko Jacob, Morten Stöckel

Publication date: 19 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_64

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Randomized algorithms (68W20)

Related Items (2)

An introduction to the computational complexity of matrix multiplication ⋮ Unnamed Item

Cites Work

• Finding and counting given length cycles
• Matrix multiplication via arithmetic progressions
• A note on compressed sensing and the complexity of matrix multiplication
• Matching is as easy as matrix inversion
• An improved combinatorial algorithm for Boolean matrix multiplication
• Gaussian elimination is not optimal
• The Input/Output Complexity of Sparse Matrix Multiplication
• Fast sparse matrix multiplication
• Maximum matchings in general graphs through randomization
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• Color-coding
• Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
• Multiplying matrices faster than coppersmith-winograd
• Compressed matrix multiplication
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Fast Output-Sensitive Matrix Multiplication