Intractability and the use of heuristics in psychological explanations (Q383037): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11229-010-9847-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2159231272
@@ Property / OpenAlex ID: W2159231272 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of propositional STRIPS planning
+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 @@
+Q2744910
@@ Property / cites work: Q2744910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Truthlikeness for hypotheses expressed in terms of \(n\) quantitative variables
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Q4201937
@@ Property / cites work: Q4201937 / rank @@
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem
+Normal rank
@@ Property / cites work @@
+Q5421717
@@ Property / cites work: Q5421717 / rank @@
+Normal rank