Agnes Schleitzer

Computationally Hard Problems Are Hard for QBF Proof Systems Too

There has been tremendous progress in the past decade in the field of quantified Boolean formulas (QBF), both in practical solving as well as in creating a theory of corresponding proof systems and their proof complexity analysis. Both for solving and for proof complexity, it is important to have in…