Workshop "Frontiers in Complexity Lower Bounds" @ Isaac Newton Institute (Cambridge, UK), 7-11 September 2026
Igor Carboni Oliveira via dmanet <[email protected]> Wed, 13 May 2026 21:57:15 +0100
| Newsgroups | gmane.science.mathematics.discrete |
|---|---|
| Message-ID | <CAH7CuEdQVKjQT+FMRkQJOiB7Mm523dRxu8e1yVXSYaJ-3oK=Ug@mail.gmail.com> |
--------------------------------------------------------------------------------------------------- *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 ********************************************************** * * Contributions to be spread via DMANET are submitted to * * [email protected] * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************