Author:
Cano Andrés,Moral Serafín
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Arnborg S., D.G. Corneil, A. Proskurowski (1987) Complexity of finding embeddings in a k-tree. SIAM Jour. Alg. Discr. Meth.
8, 277–284.
2. Cano J.E., M. Delgado, S. Moral (1993) An axiomatic framework for the propagation of uncertainty in directed acyclic graphs. International Journal of Approximate reasoning
8 253–280.
3. Chin H.L., G.F. Cooper (1989) Bayesian network inference using simulation. In: Uncertainty in Artificial Intelligence, 3 (Kanal, Levitt, Lemmer, eds.) North-Holland, 129–147.
4. Cooper G.F. (1988) Probabilistic inference using belief networks is NP-hard. Technical Report KSL-87-27, Stanford University, Stanford, California.
5. Cooper G.F. The computational complexity of probabilistic inference using bayesian belief networks is NP-hard. Artificial Intelligence
42, 393–405.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献