Two tractable subclasses of minimal unsatisfiable formulas (Q1961649): Difference between revisions

@@ Property / author @@
-Zhao, Xishun
@@ Property / author: Zhao, Xishun / rank @@
-Normal rank
@@ Property / author @@
-Ding, Decheng
@@ Property / author: Ding, Decheng / rank @@
-Normal rank
@@ Property / author @@
+Zhao, Xishun
@@ Property / author: Zhao, Xishun / rank @@
+Normal rank
@@ Property / author @@
+Ding, Decheng
@@ Property / author: Ding, Decheng / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+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 @@
+Solvable matrices
@@ Property / cites work: Solvable matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1961649