Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

LEAP

Financiado

Cerrado

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... ver más

31/12/2029

WEIZMANN

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

WEIZMANN INSTITUTE OF SCIENCE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2025-01-01

ERC-2023-ADG: ERC ADVANCED GRANTS Scope:Objectives

I+D

Cerrada hace 1 año

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

WEIZMANN

Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

COHOMCODES Robust Codes from Higher Dimesional Expanders 1M€ Cerrado

PCPHDX Probabilistically Checkable Proofs Agreement Tests and Hig... 2M€ Cerrado

VERICOMP Foundations of Verifiable Computing 2M€ Cerrado

STRONGPCP Strong Probabilistically Checkable Proofs 2M€ Cerrado

ESCSSE Embedding Sparse Combinatorial Structures using Sublinear Ex... 159K€ Cerrado

COCAN Complexity and Condition in Algebra and Numerics 2M€ Cerrado

Duración del proyecto: 59 meses Fecha Inicio: 2025-01-01
Fecha Fin: 2029-12-31

Líder del proyecto

WEIZMANN INSTITUTE OF SCIENCE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto 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.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores