Back to Results
First PageMeta Content
Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Matrix multiplication algorithm / NP-complete problems / Matching / Routing algorithms / Computational complexity theory / Connected component / Dynamic programming / Graph coloring


Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †
Add to Reading List

Document Date: 2014-11-26 08:32:33


Open Document

File Size: 381,17 KB

Share Result on Facebook