📋 Tender Overview
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 Exploration Will Be Through Harnessing The Power Of The Beautiful Emerging Theory Of High-Dimensional Expansion (Hdx). Generalizing The Concept Of Expander Graphs To Higher Dimensions, Hdx Emerge As An Exciting Cross-Disciplinary Theory With Roots In Group Theory, Number Theory, Algebraic Topology, Combinatorics, And Theoretical Computer Science. The Hdx Theory Is Characterized By A Local-To-Global Principle, Which Allows Inferences About The Global Structure Based On Local Link Properties. This Principle Bears Significant Potential For Areas Like Property Testing And It Has Already Shown Its Power With The Construction Of C^3 Locally Testable Codes. As These Are Very Closely Connected To Pcps, We Seek To Harness Hdx Towards Advancing Our Understanding Of More General Local-To-Global Encodings, And Potentially Paving The Way For Novel Pcp Constructions.
The Research Directions Outlined In This Proposal Cover A Wide Array Of Goals, Including The Exploration Of The Hdx Theory, The Construction Of New Pcps, Inapproximability, And The Creation Of Novel Error-Correcting Codes. These Directions Seek To Bridge Various Areas Of Mathematics And Computer Science, Promising To Contribute Significantly To The Field And Open Up New Horizons For Further Research And Applications.
Funded Under
European Research Council (Erc)
Total Cost
€ 2 105 840,00
Eu Contribution
€ 2 105 840,00
Coordinated By
Weizmann Institute Of Science
Israel
Start Date
1 January 2025
End Date
31 December 2029
Objective
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 exploration will be through harnessing the po
