Easy problems are sometimes hard (Q1342226): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(94)90109-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2137154807
@@ Property / OpenAlex ID: W2137154807 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / 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 @@
+Easy problems are sometimes hard
@@ Property / cites work: Easy problems are sometimes hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4835268
@@ Property / cites work: Q4835268 / rank @@
+Normal rank
@@ Property / cites work @@
+The hardest constraint problems: A double phase transition
+Normal rank
@@ Property / cites work @@
+Branch-and-cut solution of inference problems in propositional logic
+Normal rank
@@ Property / cites work @@
+Solving propositional satisfiability problems
@@ Property / cites work: Solving propositional satisfiability problems / rank @@
+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