Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700): Difference between revisions

@@ Property / author @@
-John V. Franco
@@ Property / author: John V. Franco / rank @@
-Normal rank
@@ Property / author @@
+John V. Franco
@@ Property / author: John V. Franco / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An Average Time Analysis of Backtracking
@@ Property / cites work: An Average Time Analysis of Backtracking / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
+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 @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Average time analyses of simplified Davis-Putnam procedures
+Normal rank
@@ Property / cites work @@
+The Pure Literal Rule and Polynomial Average Time
@@ Property / cites work: The Pure Literal Rule and Polynomial Average Time / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0255(90)90030-e
+Normal rank
@@ Property / OpenAlex ID @@
+W2054387247
@@ Property / OpenAlex ID: W2054387247 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:918700