Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Posted on December 9, 2011 by Gil Kalai

This post follows a recent paper On sunflowers and matrix multiplication by Noga Alon, Amir Spilka, and Christopher Umens (ASU11) which rely on an earlier paper Group-theoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans (CKSU05), … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged Amir Spilka, Cap sets, Christopher Umens, Extremal combinatorics, Matrix multiplication, Noga Alon, sunflowers | 9 Comments

	Aleksander Coho on Elchanan Mossel’s Amazin…
	Gil Kalai on Gil’s Collegial Quantum…
	TYI 41: How many ste… on Gil’s Collegial Quantum…
	The story of Poincar… on Gil’s Collegial Quantum…
	Gil Kalai on Gil’s Collegial Quantum…
	Peter Shor on Gil’s Collegial Quantum…
	Gil Kalai on Gil’s Collegial Quantum…
	Peter Shor on Gil’s Collegial Quantum…
	Gil Kalai on Lior, Aryeh, and Michael
	Gil Kalai on Gil’s Collegial Quantum…
	Google, IBM, and the… on Quantum computers: amazing pro…
	Not Quite Getting Up… on Gil’s Collegial Quantum…

Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives