Tag Archives: Matrix multiplication

Cup 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 | 1 Comment

	Jon Awbrey on Influence, Threshold, and…
	Combinatorics and Mo… on Four Derandomization Problems
	Combinatorics and Mo… on Extremal Combinatorics VI: The…
	Gil Kalai on The Simplex, the Cyclic polyto…
	Ada the Amplifier \|… on Quantum computing: achievable…
	From Oberwolfach: Th… on Seven Problems Around Tverberg…
	20 years in quantum… on Quantum computing: achievable…
	Midrasha Mathematica… on Amazing: Peter Keevash Constru…
	Gil Kalai on Quantum computing: achievable…
	Alexander Vlasov on Quantum computing: achievable…
	vznvzn on Quantum computing: achievable…
	Gil Kalai on Quantum computing: achievable…

Tag Archives: Matrix multiplication

Cup Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Follow “Combinatorics and more”