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

	fanzheng1729 on A sensation in the morning new…
	Shtetl-Optimized… on A sensation in the morning new…
	AllThings.GO on Is it Legitimate/Ethical for G…
	Gil Kalai on TYI38 Lior Kalai: Monty Hall M…
	Answer to TYI 37: Ar… on Which Coalition to Form (…
	Answer to TYI 37: Ar… on Which Coalition?
	Answer to TYI 37: Ar… on Test Your Intuition (or simply…
	Yuval Peres on Answer to TYI 37: Arithmetic P…
	Gil Kalai on Henry Cohn, Abhinav Kumar, Ste…
	Gil Kalai on A sensation in the morning new…
	yaroslav shitov on A sensation in the morning new…
	Anon80 on A sensation in the morning new…

Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives