This talk will start with an overview of the relatively young field of QBF proof complexity, explaining the QBF proof system QURes, and an assessment of existing lower bound techniques. In the main part of the talk, I will describe a characterisation of QURes proof size in terms of a model in circuit complexity called term decision lists, yielding very direct connections between circuit lower bounds and QURes proof size lower bounds. Joint work with Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl.
YouTube Live : https://www.youtube.com/watch?v=Zn7ZzaELF6A
