The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
暂无分享,去创建一个
Johan Kwisthout | Linda C. van der Gaag | Hans L. Bodlaender | J. Kwisthout | H. Bodlaender | L. V. D. Gaag
[1] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[2] Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.
[3] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[4] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[5] Dániel Marx,et al. Can you beat treewidth? , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Gregory F. Cooper,et al. The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..
[7] Toniann Pitassi,et al. Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.
[8] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[9] Hans L. Bodlaender,et al. Treewidth: Characterizations, Applications, and Computations , 2006, WG.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[12] Venkat Chandrasekaran,et al. Complexity of Inference in Graphical Models , 2008, UAI.
[13] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[14] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[15] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[16] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.