Some pitfalls for experimenters with random SAT (Q2674180): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / 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 @@
+Algorithms for testing the satisfiability of propositional formulae
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution vs. cutting plane solution of inference problems: Some computational experience
+Normal rank
@@ Property / cites work @@
+Computational experience with an interior point algorithm on the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Q3985347
@@ Property / cites work: Q3985347 / rank @@
+Normal rank
@@ Property / cites work @@
+Critical behavior in the computational cost of satisfiability testing
+Normal rank
@@ Property / cites work @@
+Generating hard satisfiability problems
@@ Property / cites work: Generating hard satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the satisfiability problem by using randomized approach
+Normal rank