On subclasses of minimal unsatisfiable formulas (Q1841884): Difference between revisions

@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263797
@@ Property / cites work: Q4263797 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets resolved
@@ Property / cites work: The complexity of facets resolved / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank