Extension and equivalence problems for clause minimal formulae (Q1777408): Difference between revisions

@@ Property / DOI @@
-.1007/s10472-005-0435-3
@@ Property / DOI: 10.1007/s10472-005-0435-3 / rank @@
-Normal rank
@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Minimal Representation of Directed Hypergraphs
@@ Property / cites work: Minimal Representation of Directed Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4488342
@@ Property / cites work: Q4488342 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5309031
@@ Property / cites work: Q5309031 / 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 @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10472-005-0435-3
@@ Property / DOI: 10.1007/S10472-005-0435-3 / rank @@
+Normal rank