Computationally Hard Problems Are Hard for QBF Proof Systems Too.

Agnes Schleitzer, Olaf Beyersdorff

Browse the full AAAI paper archive.