Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Quantified Boolean Formulas
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
ACM Transactions on Computational Logic
, sep 2022, Association for Computing Machinery.
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Meena Mahajan
,
Tomas Peitl
bib
DOI
bib
×