On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks

Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks, which conventionally are believed to have efficient inference algorithms, the computational complexity is still NP-hard.

• Type: Conference
• Year: 2005
• Where: RSFDGRC
• Authors: Dan Wu, Cory J. Butz
• Keywords: Bayesian Networks, Computational Complexity, Exact Inference, RSFDGRC 2005