Hard satisfiable instances for DPLL-type algorithms (Q2577593): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10958-005-0105-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2024260528
@@ Property / OpenAlex ID: W2024260528 / rank @@
+Normal rank
@@ Property / cites work @@
+A sharp threshold in proof complexity
@@ Property / cites work: A sharp threshold in proof complexity / rank @@
+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 @@
+Algorithms for Sat and upper bounds on their complexity
+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 @@
+On the complexity of regular resolution and the Davis-Putnam procedure
+Normal rank
@@ Property / cites work @@
+New worst-case upper bounds for SAT
@@ Property / cites work: New worst-case upper bounds for SAT / rank @@
+Normal rank
@@ Property / cites work @@
+SAT local search algorithms: Worst-case study
@@ Property / cites work: SAT local search algorithms: Worst-case study / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952609
@@ Property / cites work: Q4952609 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / rank @@
+Normal rank