Minimal False Quantified Boolean Formulas

DOI10.1007/11814948_32zbMath1152.68449OpenAlexW1483295069MaRDI QIDQ5756555

Zhao, Xishun, Hans Kleine Büning

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ Computational complexity of quantified Boolean formulas with fixed maximal deficiency ⋮ Strong inconsistency

This page was built for publication: Minimal False Quantified Boolean Formulas