Existence of simple propositional formulas (Q917333): Difference between revisions

@@ Property / cites work @@
+Recognizing disguised NR(1) instances of the satisfiability problem
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Renaming a Set of Clauses as a Horn Set
@@ Property / cites work: Renaming a Set of Clauses as a Horn Set / rank @@
+Normal rank
@@ Property / cites work @@
+On renaming a set of clauses as a Horn set
@@ Property / cites work: On renaming a set of clauses as a Horn set / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank