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

EXT

Financiado

Cerrado

Randomness Extractors Constructions and Applications

"Randomness extractors are central in theoretical computer science and have a huge impact in complexity theory, error correcting codes, and cryptography to name a few. Informally, a randomness extractor is an algorithm that ""pur... ver más

31/08/2025

TAU

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

TEL AVIV UNIVERSITY 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 H2020 notifico la concesión del proyecto el día 2020-08-13

ERC-2020-STG: ERC STARTING GRANTS

I+D

Cerrada hace 5 años

0% 100% 100%

Información adicional privada

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

1 Participantes

TAU

1.49M€ | 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

CC Combinatorial Construction 2M€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

ECCC Error-correcting Codes and Computation 1M€ Cerrado

RAC Randomness and Computation 1M€ Cerrado

HOFGA The Hardness of Finding Good Algorithms 1M€ Cerrado

COGENT Cohomology, Geometry, Explicit Number Theory Cerrado

Duración del proyecto: 60 meses Fecha Inicio: 2020-08-13
Fecha Fin: 2025-08-31

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

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

Descripción del proyecto "Randomness extractors are central in theoretical computer science and have a huge impact in complexity theory, error correcting codes, and cryptography to name a few. Informally, a randomness extractor is an algorithm that ""purifies"" the randomness of an imperfect random source by extracting from it a sequence of uniform and independent random bits. The myriad of applications make randomness extractor theory a vibrant and exciting research field with a major impact. Over the last few years, there has been a flurry of progress on deep long-standing open problems in the field and the PI's work played a key role in this development. Several novel ideas were introduced which give hope that other long-standing open problems in the field can be resolved. Moreover, the new techniques raise new and intriguing questions. In this research, we propose to study some of the most important open problems in randomness extractor theory: classic as well as the new challenges that arise. Moreover, we propose to apply results and techniques from randomness extract theory to three carefully chosen problems with a huge impact on their respective fields: (1) derandomization of space-bounded computation; (2) Ramsey graph constructions; and (3) locally decodable codes. Progress on any of these problems would be ground breaking. Despite the significant challenge, we believe that we are in a unique place to pursue these long-standing open problems both within randomness extractors theory and beyond. Indeed, as mentioned, the PI's work on randomness extractors was pivotal to the exciting progress in the field. Moreover, the PI obtained a breakthrough result on Ramsey graphs construction and the first improvement in 25 years on a problem related to derandomization of space-bounded computation. Both results were obtained using machinery from randomness extractor theory."

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores