Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PROOF COMPLEXITY:
Reports tagged with Proof Complexity:
TR24-162 | 24th October 2024
Agnes Schleitzer, Olaf Beyersdorff

Computationally Hard Problems Are Hard for QBF Proof Systems Too

Revisions: 1

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 interesting ... more >>>




ISSN 1433-8092 | Imprint