Hola,
Are you new here?

HOFGA

financed

The Hardness of Finding Good Algorithms

"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 setti... see more

29/02/2028

CIENCIAS ULISBOA

1M€

Project Budget: 1M€

Project leader

FACULDADE DE CIENCIAS DA UNIVERSIDADE DE LISB... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

PARTICIPATION DEPralty Sin fecha límite de participación.

Financing granted El organismo HORIZON EUROPE notifico la concesión del proyecto The day 2023-03-01

ERC-2021-STG: ERC STARTING GRANTS Scope:Objectives

I+D

Cerrada

0% 100%

characteristics of the participant

Este proyecto no cuenta con búsquedas de partenariado abiertas en este momento.

Private Information

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

CIENCIAS ULISBOA

Leader

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Project duration: 59 months Date Start: 2023-03-01
End date: 2028-02-29

Project leader

FACULDADE DE CIENCIAS DA UNIVERSIDADE DE LISB... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Project Budget 1M€

participation deadline Sin fecha límite de participación.

Project description "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."

Conecta tu I+D

Entra hoy

Forgot your password?

Financing

Companies

CTIs/Universidades

Projects

researchers