People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Quantified Boolean Formulas
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
We provide a tight characterisation of proof size in resolution for quantified Boolean formulas (QBF) via circuit complexity. Such a …
Beyersdorff, Olaf
,
Blinkhorn, Joshua
,
Mahajan, Meena
,
Tomas Peitl
Cite
DOI
Cite
×