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

The Hardness of Finding Good Algorithms

Project description

Improving methodology for finding efficient algorithms

A fundamental question in computer science – one dating back to the origins of the field – is how difficult it is to find an efficient algorithm for a given computational problem. This question is deeply connected to the challenge of proving that certain problems cannot be solved efficiently no matter what algorithm is used, and it has significant implications for cryptography, pseudorandomness and machine learning. The ERC-funded HOFGA project investigates this question across several settings where it remains unanswered, including circuit complexity, communication complexity, data structures and algebraic models of computation. The project will either develop powerful new methods for finding optimal algorithms or establish that finding such algorithms is provably hard – either outcome representing a significant advance in computational complexity.

Objective

"This is a project in Computational Complexity. The project aims to answer the following question:

How hard is it to find a good algorithm for a given computational problem?

This question can be asked in several different settings, depending on what one means by ""algorithm"" (what is the computational model?), ""computational problem"" (is it a decision problem? a search problem? a communication problem?), and by ""good"" (do we want an algorithm that uses little time? little memory? few logical gates?).

This question has a deep connection with the problem of proving lower-bounds, and in almost every setting where the question has been answered, either the answer was discovered while attempting to prove lower-bounds, or obtaining the answer required the development of new lower-bound methods. It is also known that several variants of the above question are equivalent to fundamental open questions in cryptography, pseudorandomness, and learning theory.

The goal of this project is to answer this question in various settings where the answer is unknown: in circuit complexity, communication complexity, data structures, and algebraic models of computation. For each of these settings, we will either provide explicit methods for finding efficient algorithms, or show that the problem of finding such efficient algorithms is NP-hard."

Fields of science (EuroSciVoc)

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-2021-STG

See all projects funded under this call

Host institution

FACULDADE DE CIENCIAS DA UNIVERSIDADE DE LISBOA
Net EU contribution
€ 1 039 809,18
Address
CAMPO GRANDE C5 PISO 3
1749-016 Lisboa
Portugal
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 1 498 664,00

Beneficiaries (3)