Approximate belief updating in max-2-connected Bayes networks is NP-hard

Authors:
Erez Karpas;Solomon Eyal Shimony;Amos Beimel
Affiliations:
Faculty of Industrial Engineering, Technion, Haifa, Israel;Dept. of Computer Science, Ben-Gurion University, P.O. Box 645, Beer-Sheva, Israel;Dept. of Computer Science, Ben-Gurion University, P.O. Box 645, Beer-Sheva, Israel
Venue:
Artificial Intelligence
Year:
2009

Citing 6
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Finding MAPs for belief networks is NP-hard

Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate.