On the structure of some classes of minimal unsatisfiable formulas (Q1408380): Difference between revisions

@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+CNF-Satisfiability Test by Counting and Polynomial Average Time
+Normal rank
@@ Property / cites work @@
+On subclasses of minimal unsatisfiable formulas
@@ Property / cites work: On subclasses of minimal unsatisfiable formulas / 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 @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank