Switch to: Citations

References in:

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Solomon E. Shimony & Carmel Domshlak

Artificial Intelligence 151 (1-2):213-225 (2003)

Add references

You must login to add references.

The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.details Download Export citation Bookmark 73 citations
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.details Download Export citation Bookmark 25 citations
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks.David Poole - 1996 - Artificial Intelligence 88 (1-2):69-100.details Download Export citation Bookmark 1 citation
Local conditioning in Bayesian networks.F. J. Díez - 1996 - Artificial Intelligence 87 (1-2):1-20.details Download Export citation Bookmark 5 citations
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.details Download Export citation Bookmark 28 citations
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.details Download Export citation Bookmark 21 citations
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.details Download Export citation Bookmark 31 citations
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.details Download Export citation Bookmark 12 citations

1