Reasons for Hardness in QBF Proof Systems

DOI10.1145/3378665zbMath1499.03053OpenAlexW3009797996MaRDI QIDQ5053061

Luke Hinde, Olaf Beyersdorff, Ján Pich

Publication date: 5 December 2022

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3378665

zbMATH Keywords

lower boundsresolutionproof complexityquantified Boolean formulas

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (3)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Lower bounds for QCDCL via formula gauge

This page was built for publication: Reasons for Hardness in QBF Proof Systems