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

	amsterguy on Paul Balister, Béla Bollobás,…
	Paul Balister, Béla… on Poznań: Random Structures and…
	Paul Balister, Béla… on Discrepancy, The Beck-Fiala Th…
	Gil Kalai on 8866128975287528³+(-8778405442…
	Gil Kalai on TYI 39 : Can a coalition of ch…
	Joseph on TYI 39 : Can a coalition of ch…
	vznvzn on Computer Science and its Impac…
	Gil Kalai on Coloring Problems for Arrangem…
	Computer Science and… on Amazing: Ryan Alweiss, Shachar…
	Computer Science and… on Avi Wigderson’s: “…
	Konstantin Golubev on Coloring Problems for Arrangem…
	Fedor Petrov on Richard Ehrenborg’s prob…

Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives