Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, October 24, 2024, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Simon Weber

Connections between Search Complexity and Proof Complexity

In this talk I will cover the fascinating connections between the query complexity of Total Search Problems and the proof complexity of their associated unsatisfiable CNF formulas. Most of the talk will be on existing results, but if time permits I will also talk about our ongoing research on finding new proof systems for some total search problem complexity classes.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login