Dear colleagues, This is to announce the following workshop at Cambridge. November 30 – December 4, 2026 Isaac Newton Institute for Mathematical Sciences, University of Cambridge https://www.newton.ac.uk/event/lfcw03/ Registration deadline: *September 20, 2026* This workshop will bring together researchers from several areas of complexity to discuss recent connections between proof complexity and computation. These connections often rely on ideas and techniques from communication complexity, algebraic complexity, circuit complexity, and the complexity of total search problems. They have led to new perspectives on the power and limitations of proof systems, and to new methods for establishing complexity lower bounds and unprovability results. The talks will focus on developments in and around proof complexity, including communication-based lower-bound methods, lifting theorems, algebraic techniques, circuit lower bounds, and connections with search problems. The workshop will provide a forum for presenting current research with emphasis on lower bounds, barriers, and connections between different models of computation and proofs. Best wishes, Iddo -- Professor Iddo Tzameret Chair in Computational Complexity Department of Computing Imperial College London Huxley Building South Kensington Campus London, SW7 2AZ E-mail: i.tzameret@imperial.ac.uk Website: https://www.doc.ic.ac.uk/~itzamere/ ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * 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/ * **********************************************************