Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

First Page		Document Content
Date: 2014-11-26 08:32:33 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 Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 381,17 KB Share Document on Facebook

	Design of Parallel and High Performance Computing HS 2013 Markus P¨ uschel, Torsten Hoefler Department of Computer Science ETH Zurich DocID: 1rlc8 - View Document
	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 DocID: 1rgSV - View Document
	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † DocID: 1rcVB - View Document
	Inversion Modulo Zero-dimensional Regular Chains ´ Marc Moreno Maza, Eric Schost, and Paul Vrbik Department of Computer Science, Western University DocID: 1qREE - View Document
	SOUTHWICK C E PRIMARY SCHOOL CALCULATION POLICY Multiplication Reception Year DocID: 1qMRJ - View Document