A computational-level explanation of the speed of goal inference (Q2437256): Difference between revisions

@@ Property / cites work @@
+Approximating MAPs for belief networks is NP-hard and other theorems
+Normal rank
@@ Property / cites work @@
+Q4542552
@@ Property / cites work: Q4542552 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of abduction
@@ Property / cites work: The computational complexity of abduction / rank @@
+Normal rank
@@ Property / cites work @@
+Goals and means in action observation: a computational approach
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Coherence measures and inference to the best explanation
+Normal rank
@@ Property / cites work @@
+Bayesian Networks and Decision Graphs
@@ Property / cites work: Bayesian Networks and Decision Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Most probable explanations in Bayesian networks: complexity and tractability
+Normal rank
@@ Property / cites work @@
+Q5715665
@@ Property / cites work: Q5715665 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Finding MAPs for belief networks is NP-hard
@@ Property / cites work: Finding MAPs for belief networks is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability and approximation of optimization theories of cognition
+Normal rank
@@ Property / cites work @@
+Intractability and the use of heuristics in psychological explanations
+Normal rank