Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (Q3637174): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02777-2_36
+Normal rank
@@ Property / OpenAlex ID @@
+W1605407652
@@ Property / OpenAlex ID: W1605407652 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence of Horn and network complexity for Boolean functions
+Normal rank
@@ Property / cites work @@
+Models and quantifier elimination for quantified Horn formulas
+Normal rank
@@ Property / cites work @@
+Resolution for quantified Boolean formulas
@@ Property / cites work: Resolution for quantified Boolean formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815282
@@ Property / cites work: Q3815282 / rank @@
+Normal rank
@@ Property / cites work @@
+Nenofex: Expanding NNF for QBF Solving
@@ Property / cites work: Nenofex: Expanding NNF for QBF Solving / rank @@
+Normal rank
@@ Property / cites work @@
+QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
+Normal rank