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

	clownstotheleft on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Anonymous on To cheer you up in difficult t…
	Silver linings \| in… on To cheer you up in difficult t…
	shacharlovett on To cheer you up in difficult t…
	To cheer you up in d… on An Open Discussion and Polls:…
	To cheer you up in d… on Mind Boggling: Following the w…
	To cheer you up in d… on More Math from Facebook
	To cheer you up in d… on Roth’s Theorem: Tom Sand…
	To cheer you up in d… on Pushing Behrend Around
	구글의 양자컴퓨터 vs 고전 시뮬레이… 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