Classes of hard formulas for QBF resolution

DOI10.4230/LIPICS.SAT.2022.5MaRDI QIDQ6572016zbMATH OpenFDO

Authors Agnes Schleitzer, Olaf Beyersdorff

Publication date 12 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2022.5

zbMATH Keywords

proof complexityQBFresolutionseparations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Classes of hard formulas for QBF resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572016)