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
![](http://www.birs.ca/files/images/poster.png)
©2024 Banff International Research Station for Mathematical Innovation and Discovery. All Rights Reserved.