First Page | Document Content | |
---|---|---|
Date: 2014-11-26 08:32:33Graph 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 ListSource URL: www.cs.huji.ac.ilDownload Document from Source WebsiteFile Size: 381,17 KBShare Document on Facebook |