📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (2022)

First Author: Chiesa A

Attributed to: Foundations of classical and quantum verifiable computing funded by UKRI FLF

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/20m135515x

Publication URI: http://dx.doi.org/10.1137/20m135515x

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 6