Skip to main content
European Commission logo print header

Phase transitions and computational complexity

Objectif

This is a project in the area of Theoretical Computer Science, particularly discrete algorithms and computational complexity. Many Constraint Satisfaction Problems (`CSPs') such as Boolean satisfiability or graph coloring are well-known to be NP-hard, i.e. the worst-case computation time to solve these problems is exponential in the size of the problem instance. To illuminate the conceptual origins of the computational hardness of these problems, a major research effort over the past 30 years has been the study of Random instances of CSPs. Over the past decade, motivated by problems in statistical mechanics, physicists have developed stunningly detailed hypotheses on the structural and conceptual nature of random CSPs, based on ingenious but highly non-rigorous techniques. These hypotheses have led to a new class of Message Passing Algorithms, as well as to evidence that certain natural types of random CSPs may be computationally intractable. The goal of this project is to study these ideas rigorously and comprehensively from the perspective of the theory of computing.

Appel à propositions

ERC-2011-StG_20101014
Voir d’autres projets de cet appel

Régime de financement

ERC-SG - ERC Starting Grant

Institution d’accueil

JOHANN WOLFGANG GOETHE-UNIVERSITAET FRANKFURT AM MAIN
Contribution de l’UE
€ 1 023 040,42
Adresse
THEODOR W ADORNO PLATZ 1
60323 Frankfurt Am Main
Allemagne

Voir sur la carte

Région
Hessen Darmstadt Frankfurt am Main, Kreisfreie Stadt
Type d’activité
Higher or Secondary Education Establishments
Chercheur principal
Amin Coja-Oghlan (Prof.)
Contact administratif
Kristina Wege (Ms.)
Liens
Coût total
Aucune donnée

Bénéficiaires (2)