Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (Q3637174): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The equivalence of Horn and network complexity for Boolean functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Models and quantifier elimination for quantified Horn formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution for quantified Boolean formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3815282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nenofex: Expanding NNF for QBF Solving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency / rank | |||
Normal rank |
Latest revision as of 17:58, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits |
scientific article |
Statements
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (English)
0 references
7 July 2009
0 references