Complexity versus stability for classes of propositional formulas (Q293437): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for maximum generalized satisfiability problems.
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+On sentences which are true of direct unions of algebras
+Normal rank
@@ Property / cites work @@
+On the complexity of the maximum satisfiability problem for Horn formulas
+Normal rank
@@ Property / cites work @@
+Existence of simple propositional formulas
@@ Property / cites work: Existence of simple propositional formulas / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank