Generating hard satisfiability problems (Q2674174): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(95)00045-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2075335084
@@ Property / OpenAlex ID: W2075335084 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56039657
@@ Property / Wikidata QID: Q56039657 / rank @@
+Normal rank
@@ Property / cites work @@
+Outlier..........s
@@ Property / cites work: Outlier..........s / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140436
@@ Property / cites work: Q3140436 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4431379
@@ Property / cites work: Q4431379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / 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 @@
+Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
+Normal rank
@@ Property / cites work @@
+On the complexity of regular resolution and the Davis-Putnam procedure
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems are sometimes hard
@@ Property / cites work: Easy problems are sometimes hard / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold for unsatisfiability
@@ Property / cites work: A threshold for unsatisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution vs. cutting plane solution of inference problems: Some computational experience
+Normal rank
@@ Property / cites work @@
+Branch-and-cut solution of inference problems in propositional logic
+Normal rank
@@ Property / cites work @@
+Critical Behavior in the Satisfiability of Random Boolean Expressions
+Normal rank
@@ Property / cites work @@
+Some pitfalls for experimenters with random SAT
@@ Property / cites work: Some pitfalls for experimenters with random SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q3985347
@@ Property / cites work: Q3985347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687271
@@ Property / cites work: Q5687271 / rank @@
+Normal rank
@@ Property / cites work @@
+Critical behavior in the computational cost of satisfiability testing
+Normal rank
@@ Property / cites work @@
+Solving the satisfiability problem by using randomized approach
+Normal rank