Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Proof complexity of circuit lower bounds

Project description

Systematic theory to prove complexity lower bounds

One of the most important questions in computer science is whether highly efficient algorithms exist for problems that are currently computationally heavy to solve (they exhibit ‘proof complexity’), despite their solutions (proofs) being easily verified. This would have profound implications, from breaking established cryptography to rendering current AI approaches obsolete. A key obstacle has been proving complexity lower bounds – the minimal resources required to solve a problem. The ERC-funded ProCom project aims to develop a systematic mathematical theory around the formal barriers to proving that certain problems are fundamentally ‘hard’. This ‘proof complexity of circuit lower bounds’ bridges combinatorial methods with a novel meta-mathematical perspective, advancing understanding of both the limits and power of computation.

Objective

One of the most fundamental and notorious open problems in theoretical computer science is the possible existence of highly efficient algorithms solving NP problems: there might be fast algorithms breaking established cryptosystems, automating theorem proving, making contemporary approaches to AI obsolete, and solving practically every computational task. This issue lies at the heart of the P versus NP problem, a central question of computational complexity, and particularly in the investigation of lower bounds on the efficiency of concrete computational models such as Boolean circuits.

The notorious difficulty of proving complexity lower bounds became evident already in the early days of the theory of computing when the theory of formal barriers explaining their difficulty started to emerge. In recent years, there has been a dramatic rise of barrier results driving the field forward and connecting it to areas such as learning theory and cryptography. A better understanding of formal barriers is emerging today as the necessary requirement for further progress on central problems in computational complexity, and the goal of this project is to develop a systematic theory around it: proof complexity of circuit lower bounds. In particular, the project will bridge the rich tradition of concrete combinatorial methods with the new meta-mathematical approach via the phenomena of hardness magnification that connect strong and weak computational models. It will focus on a logic-oriented area of proof complexity investigating the lengths of propositional proofs and use its meta-mathematical perspective to explore the potential of lower bound methods in circuit complexity but also in proof complexity itself.

The proposed meta-mathematical approach presents a novel perspective on established topics in computational complexity with a potential to deliver a paradigmatic shift in the field and bring us closer to the full understanding of the power of computing.

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2025-COG

See all projects funded under this call

Host institution

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Net EU contribution
€ 1 999 843,00
Address
WELLINGTON SQUARE UNIVERSITY OFFICES
OX1 2JD Oxford
United Kingdom
Region
South East (England) Berkshire, Buckinghamshire and Oxfordshire Oxfordshire
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 1 999 843,00

Beneficiaries (1)