From stefan.grosser1 at gmail.com Fri May 2 22:35:05 2025 From: stefan.grosser1 at gmail.com (Stefan Grosser) Date: Fri, 2 May 2025 16:35:05 -0400 Subject: [Proof Complexity] STOC Workshop on Constructive Complexity: Call for Short Talks and Posters Message-ID: Dear colleagues, At STOC 2025, Marco Carmosino, Iddo Tzameret, Neil Thapen, and I will be running a workshop on Constructive Complexity Theory and Bounded Arithmetic. This workshop will highlight algorithmic and metamathematical perspectives of complexity theory, and will discuss recent progress on the (un)provability of complexity-theoretic statements in bounded arithmetic. Included will be a series of introductory lectures, research spotlights, short talks/posters, and a panel discussion. For full details on topics covered and the current schedule, see here: CCT 2025 - Constructive Complexity Theory 2025 *Call for Short Talks and Posters:*Along with our invited speakers, we will have two additional opportunities for talks at the workshop: an online poster session and a series of flash talks. Both of these events will occur on June 24th. If you are interested in participating in either of these, please fill out the form linked below. *Short Talk:* During the second half of our June 24th workshop session, we will have a series of 4-6 short talks of 8-10 minutes. Each talk should highlight recent research in constructive complexity and bounded arithmetic, or pose a new direction or open problem. *Online Poster Session:* In the evening of June 24th, combined with the STOC Online Poster Session, we will have an online Gathertown event for a poster session. The posters will be in a similar style to the short talks: short talks detailing recent research and open problems. After May 15th, we will accept talk proposals on a *rolling basis.* Register for a Short Talk or Online Poster: Registration Here Best, Stefan Grosser