[Proof Complexity] Workshop "Frontiers in Complexity Lower Bounds" @ Isaac Newton Institute (Cambridge, UK), 7-11 September 2026

[Igor Carboni Oliveira]

---------------------------------------------------------------------------------------------------
*Workshop: *"*Frontiers in Complexity Lower Bounds*"
Dates: 7 to 11 September 2026
Website: https://www.newton.ac.uk/event/lfcw01/
Venue: Isaac Newton Institute for Mathematical Sciences, Cambridge, UK
*Registration deadline: 19 July 2026*
---------------------------------------------------------------------------------------------------

Dear colleagues,

We are pleased to announce the workshop "Frontiers in Complexity Lower
Bounds", which will take place at the Isaac Newton Institute for
Mathematical Sciences in Cambridge from 7 to 11 September 2026.

Many fundamental questions in complexity theory, such as the P vs NP
problem, are about complexity lower bounds: proofs that computational
problems cannot be solved within a given set of resources. This workshop
will revisit the state of the art in complexity lower bounds, including
recent work on lower bounds in weak models and new approaches to showing
lower bounds for stronger models, as well as work on formulating and
understanding various kinds of barriers to lower bounds.

Registration is required and closes on 19 July 2026. The registration form
is available on the event website.

We hope to see many of you in Cambridge.

Organisers: Igor Carboni Oliveira, Nutan Limaye, and Rahul Santhanam