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.
CS Theory Events 