Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

MCT

Financiado

Cerrado

Metacomputational Complexity Theory

The goal of the project is to advance our understanding of the central questions in Computational Complexity Theory such as the famous P versus NP problem. Complexity Theory approaches questions about efficiency of computation b... ver más

28/02/2022

UOXF

213K€

Presupuesto del proyecto: 213K€

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2022-02-28

MSCA-IF-2019: Individual Fellowships

I+D

Cerrada hace 5 años

0% 100%

Información adicional privada

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

1 Participantes

UOXF

212.93K€ | Lider

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

Proyectos interesantes

PAC Proofs and Computation 2M€ Cerrado

UTHOTP Understanding the Hardness of Theorem Proving 1M€ Cerrado

HOFGA The Hardness of Finding Good Algorithms 1M€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

VERICOMP Foundations of Verifiable Computing 2M€ Cerrado

ALBA Algebraic Formula Lower Bounds and Applications 2M€ Cerrado

Duración del proyecto: 24 meses Fecha Inicio: 2020-02-20
Fecha Fin: 2022-02-28

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 213K€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto The goal of the project is to advance our understanding of the central questions in Computational Complexity Theory such as the famous P versus NP problem. Complexity Theory approaches questions about efficiency of computation by investigating lower and upper bounds on the complexity of concrete computational models such as Boolean circuits or propositional proof systems. Unfortunately, even after several decades of intense research the progress on the question of proving strong complexity lower bounds remains very incremental. In fact, several significant barrier results have been discovered, partially explaining the complexity of establishing complexity lower bounds. While the barrier results presented a serious obstacle they also revealed new structural properties of complexity lower bounds connecting lower bounds to the construction of efficient learning algorithms, cryptography or independence results in mathematical logic. The present project continues the development of these structural connections and complexity-theoretic properties of problems about complexity, which we shortly refer to as Metacomputational Complexity Theory. The objectives of the project can be divided into two groups. 1. Hardness magnification, exploring limits and consequences of an emerging theory of hardness magnification which arouse recently from investigations of metacomputational aspects of circuit lower bounds and received a lot of attention as a promising approach overcoming previously existing barriers for proving complexity lower bounds. 2. Structural theory, strengthening and generalizing connections between the methods for proving lower bounds and other central concepts of computer science, such as efficient learning algorithms, cryptographic primitives and automatizability of propositional proof systems, through the lens of mathematical logic.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores