Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
From MaRDI portal
Publication:3637174
DOI10.1007/978-3-642-02777-2_36zbMath1247.68237MaRDI QIDQ3637174
Hans Kleine Büning, Zhao, Xishun, Uwe Bubeck
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_36
Related Items
The Complexity Landscape of Outcome Determination in Judgment Aggregation, Quantified maximum satisfiability, Anti-alignments in Conformance Checking – The Dark Side of Process Models
Uses Software
Cites Work