OpportunityUniverse

P vs NP and Complexity Lower Bounds

Atelier
Clay Mathematics Institute Monde entier 2026

Informations

The P vs NP problem is a central open question in mathematics and theoretical computer science. This workshop brings together researchers to discuss progress, challenges, and perspectives in computational complexity, including topics such as circuit lower bounds, meta-complexity, and hardness of various theories. It aims to provide a forum for cutting-edge research and discussion on future directions in complexity theory.

Conditions d'éligibilité

Registration is by invitation with a limited number of additional places available.

Candidature

Registration by invitation; to register interest, email the organizers (Naomi Kraker) and provide institutional affiliation and the workshop preference.

Vérifie toujours les informations sur le site officiel avant de postuler. Une erreur ? Dis-le-nous.

Opportunités similaires

Newsletter des opportunités

Reçois chaque semaine les meilleures nouvelles bourses, concours et programmes directement dans ta boîte mail, sélectionnés selon ton pays, ton niveau et tes centres d’intérêt.

✓ Hebdomadaire ✓ Personnalisé ✓ 100% gratuit