Connections Between Qbf Proof Complexity

Olaf Beyersdorff (Friedrich Schiller University Jena) ...

Particular emphasis will be laid on the

This talk will give an overview of what has been achieved in

Robert Robere (McGill University) https://simons.berkeley.edu/talks/

12th Innovations in Theoretical Computer Science Conference (ITCS 2021) http://itcs-conf.org/ Understanding the Relative ...

An overview of

Ryan Williams, Stanford University Fine-Grained

Sam Buss (UC San Diego) https://simons.berkeley.edu/talks/

Benjamin Böhm (University of Jena) https://simons.berkeley.edu/talks/benjamin-bohm-university-jena-2023-03-23-0

Toniann Pitassi (University of Toronto) https://simons.berkeley.edu/talks/tbd-37 Meta-

Computer Science/Discrete Mathematics Seminar II Topic: Proofs, Circuits, Communication, and Lower Bounds in

Rahul Santhanam, University of Edinburgh

A

So how does this relate

Ryan Williams, Stanford University Fine-Grained

... complexity

I cover why Quantified Boolean Formulas are interesting from a

Rahul Santhanam (University of Oxford) https://simons.berkeley.edu/talks/tbd-19 Boolean Devices.