Short proofs in QBF expansion

DOI10.1007/978-3-030-24258-9_2zbMath1441.68085OpenAlexW2954419053MaRDI QIDQ2181919

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Judith Clymo

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24258-9_2

zbMATH Keywords

resolutionpolynomial hierarchyproof complexityQBFSC

Mathematics Subject Classification ID

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

Related Items (1)

How QBF expansion makes strategy extraction hard

This page was built for publication: Short proofs in QBF expansion