[Proof Complexity] Workshop on Logical Foundations of Complexity Theory - Newton Institute
Samuel Buss
sbuss at ucsd.edu
Tue Jun 30 00:19:27 CEST 2026
Call for participation
Workshop on Logical Foundations of Complexity Theory
Isaac Newton Institute, Cambridge, UK, October 19 - October 23, 2026.
WORKSHOP THEME: Many of the fundamental concepts and problems in complexity
theory originated at least partially in mathematical logic. The power of
various feasible computational models appears to be linked with the
strength of weak formal theories, and understanding the strength of formal
theories may be useful --- if not key --- to resolving some of the open
conjectures about the power of feasible computation.
The workshop will be devoted to research on logical facets of complexity
theory, especially the interplay between formal logical theories and
computational complexity.
PARTICIPATION: Please apply online at the workshop webpage
https://www.newton.ac.uk/event/lfcw02/ to participate. The deadline for
applications is July 19, but later applications will be considered, space
permitting.
CONTRIBUTED TALKS: The organisers welcome submissions for contributed
talks. If you wish to do so, please indicate this on the relevant section
of the application form and get in contact with the organisers to express
your interest.
WEBPAGE: Full workshop information at:
https://www.newton.ac.uk/event/lfcw02/
This workshop is part of a special program held at the
Isaac Newton Institute for Mathematical Sciences on the
Logical Foundations of Computational Complexity, September 1 - December 12,
2026.
Special program website: https://www.newton.ac.uk/event/lfc/
CONFIRMED WORKSHOP SPEAKERS
Noel Arteche (Lund Univeristy and University of Copenhagen )
Albert Atserias (Universitat Politècnica de Catalunya)
Marco Carmosino (IBM Yorktown)
Anupam Das (University of Birmingham)
Susanna de Rezende (Lund University)
Edward Hirsch (Ariel University)
Dmitry Itsykson (Ben-Gurion University)
Ondrej Jezil (Charles University)
Valentine Kabanets (Simon Fraser University)
Erfan Khaniki (University of Oxford)
Antonina Kolokolova (Memorial University of Newfoundland)
Jiatu Li (MIT)
Moritz Muller (University of Passau)
Igor Oliveira (University of Warwick)
Jan Pich (University of Oxford)
Pavel Pudlak (Czech Academy of Sciences)
Hanlin Ren (Institute for Advanced Study)
Robert Robere (McGill University)
Rahul Santhanam (University of Oxford)
Neil Thapen (Czech Academy of Science)
Dimitrios Tsintsilidas (University of Warwick)
Iddo Tzameret (Imperial College London)
WORKSHOP ORGANIZERS:
Sam Buss, sbuss at ucsd.edu, University of California, San Diego
Jan Krajicek, jan.krajicek at protonmail.com, Charles University, Prague
More information about the Proof-Complexity
mailing list