A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / 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 @@
+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 @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+Q5687277
@@ Property / cites work: Q5687277 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of tractable satisfiability problems through balanced polynomial representations
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1306378