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
- Artur`s homepage | Artur Riazanovtunyash.github.io
- I believe P=NPemanueleviola.wordpress.com
- Possible future Polymath projects | Gowers's Webloggowers.wordpress.com
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- P versus NP problem - Wikipediaen.wikipedia.org
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Complexity class - Wikipediaen.wikipedia.org
- Computational Complexityblog.computationalcomplexity.org
- pnp.pdfscottaaronson.com
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca