ERC Advanced Grant · 2023
Local-to-global Expansion and PCPs
This proposal aims to delve further into the study of Probabilistically Checkable Proofs (PCPs), a cornerstone of modern theoretical computer science, that exhibits some of the most powerful local to global behavior. Any NP proof can be written in a format that is locally testable, meaning that local pieces of the proof imply very rich global structure. This theory is strongly tied to hardness of approximation and has significant applications in cryptography. A major goal is to develop simpler and more efficient PCP constructions, with better parameters, as well as to deepen our understanding of robust encodings with local to global features, such as PCPs. The main methodology of this…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.