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

Nonexistence of Short Proofs

Objective

Efficient algorithms are vital for dealing with the ever growing amounts of data in our modern world. A particularly tricky task is posed by so-called combinatorial problems, where objects need to be combined together to form a solution satisfying some specified constraints. Increasing data size quickly causes an exponential growth in the search space for such problems, and despite decades of effort no algorithms have been designed that are guaranteed to tame this combinatorial explosion. In practice, however, it is often possible to find algorithmic shortcuts that work reasonably well, although there is very limited scientific understanding of when and why this is the case. This points to a fundamental challenge: We need a better understanding of the power and limitations of modern algorithm design.

An important tool for algorithm analysis is to describe its method of reasoning in a formal proof system. When the algorithm terminates, the execution trace can be viewed as a proof of correctness of the result computed. If we can prove mathematically that no short proofs exist for certain types of statements, then this shows that the algorithm cannot possibly solve the corresponding problems efficiently.

The goal of this project is to shed light on proof systems corresponding to some of the most powerful algorithmic paradigms in wide use and to delineate their potential. One concrete objective is to study combinatorial and algebraic methods for solving well-known graph problems such as Clique. Another goal is to compare semidefinite programming to traditional algorithms for solving non-Gaussian component analysis (NGCA), a fundamental problem in statistical learning. I will do so by strengthening existing techniques for analyzing these proof systems and combining them in novel ways. In particular, one important challenge will be to study the setting where the power of a proof system needs to be understood for a distribution of problems from which the input is drawn.

Keywords

Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)

Programme(s)

Multi-annual funding programmes that define the EU’s priorities for research and innovation.

Topic(s)

Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.

Funding Scheme

Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.

HORIZON-TMA-MSCA-PF-EF - HORIZON TMA MSCA Postdoctoral Fellowships - European Fellowships

See all projects funded under this funding scheme

Call for proposal

Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.

(opens in new window) HORIZON-MSCA-2023-PF-01

See all projects funded under this call

Coordinator

KOBENHAVNS UNIVERSITET
Net EU contribution

Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.

€ 230 774,40
Address
NORREGADE 10
1165 KOBENHAVN
Denmark

See on map

Region
Danmark Hovedstaden Byen København
Activity type
Higher or Secondary Education Establishments
Links
Total cost

The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.

No data

Partners (1)

My booklet 0 0