Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano it
CORDIS - Risultati della ricerca dell’UE
CORDIS

Meta-Computational Perspectives on Proof Complexity

Obiettivo

Computational complexity theory seeks to understand the inherent difficulty of computational problems. For example, what is the fastest algorithm for factoring? Despite decades of progress, there are still problems—such as factoring—for which we lack efficient algorithms, and yet we cannot prove that they are intrinsically hard. Still, the assumption that factoring is indeed hard underpins much of modern cryptography and e-commerce. This raises a fundamental question: Why are we unable to determine the resources required to solve many computational problems?

This project addresses such meta-complexity questions—questions about the complexity of computational problems themselves—within the field of proof complexity. While similar questions in circuit complexity have led to major breakthroughs over the past decade, their counterparts in proof complexity remain largely unexplored.

I propose a systematic study of meta-complexity problems in proof complexity, with the overarching goal of explaining why current techniques fail to prove lower bounds for many natural formulas—even in weak proof systems. I aim to map the landscape of known lower bound methods, classify them by the complexity of their proofs of correctness, and push them to their theoretical limits. I also introduce two novel meta-complexity problems: encoding-independent lower bounds and the Minimum Proof Size Problem, both of which address notable gaps in the current literature.

By pursuing these goals, I seek to identify fundamental barriers and to guide future research in the field. Moreover, just as the study of the Minimum Circuit Size Problem has revealed deep connections to cryptography, learning theory, and derandomisation, a systematic investigation of analogous questions in proof complexity may uncover similar links to other areas. Ultimately, this project contributes to the broader aim of understanding the limits of efficient computation and efficient reasoning.

Campo scientifico (EuroSciVoc)

Questo progetto non è ancora stato classificato con EuroSciVoc.
Suggerisci i campi scientifici che ritieni più rilevanti e aiutaci a migliorare il nostro servizio di classificazione.

Parole chiave

Programma(i)

Argomento(i)

Meccanismo di finanziamento

HORIZON-ERC - HORIZON ERC Grants

Vedi tutti i progetti finanziati nell’ambito di questo schema di finanziamento

Invito a presentare proposte

(si apre in una nuova finestra) ERC-2026-STG

Vedi tutti i progetti finanziati nell’ambito del bando

Istituzione ospitante

LUNDS UNIVERSITET
Contributo netto dell'UE
€ 1 499 885,00
Indirizzo
Paradisgatan 5c
22100 Lund
Svezia
Regione
Södra Sverige Sydsverige Skåne län
Tipo di attività
Higher or Secondary Education Establishments
Collegamenti
Costo totale
€ 1 499 885,00

Beneficiari (1)