Total Search @ STOC 2025
Total search problems naturally arise in various areas of Theoretical Computer Science. Since the 1990s, the study of total search problems has successfully characterized significant problems in game theory, optimization, and combinatorics. This workshop aims to showcase the recent progress in
Total Search Problems in TCS Complexity, Cryptography, Combinatorics, and more STOC 2025 Workshop, 23-26 June 2025, Prague Total search problems naturally arise in various areas of Theoretical Computer Science. Since the 1990s, the study of total search problems has successfully characterized significant problems in game theory, optimization, and combinatorics. This workshop aims to showcase the recent progress in uncovering and investigating connections between various traditional TCS topics and total search problems, including: Cryptography Proof Complexity & Logic Meta-Complexity…
saved by
related reading
- Video Archiveintractability.princeton.edu
- my projectsdan-iel-lee.vercel.app
- Videos from 25w5432: Algebraic Graph Theory and Applicationsbirs.ca
- CSE 599 Recent Developments in Approximation Algorithmshomes.cs.washington.edu
- Easy Peasy at EC'26 — Rome, July 6, 2026tlundy832.github.io
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
- Thatchaphol Saranurak - Graph Decompositionsites.google.com
- Fernando Granha Jeronimo | Theoretical Computer Science | UIUCgranha.github.io
- [2604.24737] Learning to Think from Multiple Thinkersarxiv.org
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Shtetl-Optimizedscottaaronson.blog
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca