Moteur de recherche d’entreprises européennes
Financement de l’UE (212 934 €) : Théorie de la complexité métacomputationnelle Hor25/02/2020 Programme de recherche et d'innovation de l'UE « Horizon »
Vue d’ensemble
Texte
Théorie de la complexité métacomputationnelle
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.
| The Chancellor, Masters and Scholars of the University of Oxford | 212 934 € |
https://cordis.europa.eu/project/id/890220
Cette annonce se réfère à une date antérieure et ne reflète pas nécessairement l’état actuel. L’état actuel est présenté à la page suivante : THE Chancellor Masters AND Scholars OF THE University OF Oxford CHARITY, Oxford, Royaume Uni.
Les visualisations de "The Chancellor, Masters and Scholars of the University of Oxford - Financement de l’UE (212 934 €) : Théorie de la complexité métacomputationnelle"
sont mis à disposition par
North Data
et peuvent être réutilisées selon les termes de la licence
Creative Commons CC-BY.
