A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

First Page		Document Content
Date: 2014-11-26 08:31:39 Mathematics Algebra Computational complexity theory Analysis of algorithms Multiplication Numerical linear algebra Matrix multiplication algorithm Matrix multiplication Strassen algorithm Fast Fourier transform Multiplication algorithm Algorithm		A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 465,15 KB Share Document on Facebook

	COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler DocID: 1xUI5 - View Document
	Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´ DocID: 1vrNt - View Document
	2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama DocID: 1uUeI - View Document
	0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University DocID: 1uMPm - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document