Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
Work
Year: 2022
Type: article
Abstract: We provide a tight characterisation of proof size in resolution for quantified Boolean formulas (QBF) via circuit complexity. Such a characterisation was previously obtained for a hierarchy of QBF Fre... more
Cites: 38
Cited by: 2
Related to: 10
FWCI: 0.361
Citation percentile (by year/subfield): 58.55
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: bronze
Funder John Templeton Foundation
Grant ID 60842 JTF60842