Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
Attributed to:
Foundations of classical and quantum verifiable computing
funded by
FLF
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975994.84
Publication URI: http://dx.doi.org/10.1137/1.9781611975994.84
Type: Book Chapter
Book Title: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2020)
Page Reference: 1395-1411