Video From 16w5044: Computational Complexity

Friday, September 9, 2016 08:38 - 09:06
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Shubhangi Saraf, Video: High rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Shubhangi Saraf, Video: High rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Shubhangi Saraf, High rate locally-correctable and locally-testable codes with sub-polynomial query complexity, Computational Complexity, BIRS, BIRS talk, 16w5044, math, mathematics, video
Banff International Research Station
Banff International Research Station
presentation
mpeg4
78M
http://www.birs.ca/events/2016/5-day-workshops/16w5044/videos

Download this video (78M)

Other videos from this workshop