Video From 16w5044: Computational Complexity
Swastik Kopparty, Rutgers
Friday, September 9, 2016 09:07 - 09:34
Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
![](http://www.birs.ca/files/images/poster.png)
©2024 Banff International Research Station for Mathematical Innovation and Discovery. All Rights Reserved.