Sum of Squares: Upper bounds, lower bounds, and open questions

[Note: As I commented on Omer's touching post, I too was shocked by the sudden closure of the amazingly successful MSR Silicon Valley lab. I hope that this blog, whose contents had very little to do with MSR itself and everything to do with the great group of people that was there, would continue to … Continue reading Sum of Squares: Upper bounds, lower bounds, and open questions

FOCS 2014 program is online

The FOCS program is now online here.Congratulations to Yin Tat Lee and Aaron Sidford for winning the best paper and the best student paper awards for their paper "Solving Linear Programs in O˜(√rank) Iterations and Faster Algorithms for Maximum Flow". They made an important advance in the theory of interior point methods by showing that you can actually … Continue reading FOCS 2014 program is online

ICM 2014: Mark Braverman on interactive information theory

[Boaz's note: videos of all ICM 2014 talks, including Mark's talk discussed below, as well as the talks of  Candes and Bhargava I mentioned before are available online here. In particular, if you still don't know how one constructs a fully homomorphic encryption scheme then you should (a) be ashamed of yourself and (b) watch Craig Gentry's … Continue reading ICM 2014: Mark Braverman on interactive information theory