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

	Congrats Avi and Lac… on Cheerful News in Difficult Tim…
	Yiftach on Alef’s Corner
	Gil Kalai on Alef’s Corner
	Yiftach on Alef’s Corner
	PratibhaGupta on Cheerful News in Difficult Tim…
	To cheer you up in d… on The Intermediate Value Theorem…
	Closing an Erdős Pro… on To cheer you up in difficult t…
	2021 Abel Prize \| Ig… on Cheerful News in Difficult Tim…
	Cheerful News in Dif… on To Cheer You Up in Difficult T…
	Cheerful News in Dif… on To cheer you up in difficult t…
	Cheerful News in Dif… on Avi Wigderson’s: “…
	Cheerful News in Dif… on Must-read book by Avi Wig…

Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives