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

	Gil Kalai on Impagliazzo’s Multiverse
	Sergiu Hart on Sergiu Hart: Two-Vote or not t…
	If Quantum Computers… on Combinatorics, Mathematics, Ac…
	If Quantum Computers… on The Race to Quantum Technologi…
	If Quantum Computers… on Some Mathematical Puzzles that…
	If Quantum Computers… on The Quantum Computer Puzzle @…
	davidellis2 on Sergiu Hart: Two-Vote or not t…
	davidellis2 on Sergiu Hart: Two-Vote or not t…
	davidellis2 on Sergiu Hart: Two-Vote or not t…
	Sergiu Hart on Sergiu Hart: Two-Vote or not t…
	Mishael Rosenthal on Sergiu Hart: Two-Vote or not t…
	Gil Kalai on Sergiu Hart: Two-Vote or not t…

Tag Archives: Amir Spilka

Cap Sets, Sunflowers, and Matrix Multiplication

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives