Video From 13w5010: Computational Complexity

Monday, July 8, 2013 13:35 - 14:26
Communication is bounded by root of rank
Communication is bounded by root of rank
Shachar Lovett at 13w5010: Computational Complexity on Monday, July 8, 2013
0 seconds of 0 secondsVolume 0%
Press shift question mark to access a list of keyboard shortcuts
00:00
00:00
00:00
 

Download this video (150M)

Other videos from this workshop