Improving a fixed parameter tractability time bound for the shadow problem (Q1877708): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the class of pure implicational formulas
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4375757
@@ Property / cites work: Q4375757 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4860310
@@ Property / cites work: Q4860310 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the falsifiability problem for pure implicational formulas
+Normal rank
@@ Property / cites work @@
+Q4315881
@@ Property / cites work: Q4315881 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5783647
@@ Property / cites work: Q5783647 / rank @@
+Normal rank