Skip to main content
Aller à la page d’accueil de la Commission européenne (s’ouvre dans une nouvelle fenêtre)
français fr
CORDIS - Résultats de la recherche de l’UE
CORDIS

Optimal Tradeoffs between Randomness, Time, and Space

Objectif

Randomization is remarkably effective in algorithm design. In practice, randomized algorithms often outperform their deterministic counterparts; for example, there are randomized linear-time algorithms for problems where the best-known deterministic algorithms require exponential time. Yet, randomness is itself a computational resource, which may be scarce or costly. While some settings---such as cryptography---provably require randomness, in many others, notably time- and space-bounded computation, the situation is less clear. This raises the central question of when randomness is necessary or useful for efficient algorithms, and how to devise practical, generic recipes for efficient derandomization. In cases where randomness is indispensable, one typically requires access to purely random bits; however, natural sources of randomness are usually defective, making it a central goal to purify such crude randomness in a way suitable for applications.

Understanding the power and limitations of derandomization is one of the biggest challenges in complexity theory, with deep connections to many other areas.
This project tackles fundamental problems in derandomization and pseudorandomness, aiming to resolve the longstanding BPL vs. L problem, settling whether randomness is needed for space-efficient computation. It will also deepen the study of minimal-overhead derandomization, producing deterministic algorithms that match, up to negligible loss, the speed and memory footprint of their randomized counterparts. In parallel, it will develop the efficient use of weak randomness in algorithms and cryptographic protocols.
A unifying theme across all goals is the design of new pseudorandomness primitives and the development of computational analogues of fundamental random-like mathematical structures. The project's outcomes are expected not only to push the frontiers of pseudorandomness but also to have a broad impact on other areas of computer science.

Champ scientifique (EuroSciVoc)

Ce projet n'a pas encore été classé par EuroSciVoc.
Proposez les domaines scientifiques qui vous semblent les plus pertinents et aidez-nous à améliorer notre service de classification.

Mots‑clés

Programme(s)

Thème(s)

Régime de financement

HORIZON-ERC - HORIZON ERC Grants

Voir tous les projets financés dans le cadre de ce programme de financement

Appel à propositions

(s’ouvre dans une nouvelle fenêtre) ERC-2026-STG

Voir tous les projets financés au titre de cet appel

Institution d’accueil

BEN-GURION UNIVERSITY OF THE NEGEV
Contribution nette de l'UE
€ 1 500 000,00
Coût total
€ 1 500 000,00

Bénéficiaires (1)