P vs NP and Complexity Lower Bounds

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.

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

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