Computational complexity
Theorem: Inference in a multi-connected Bayesian network is NP-hard.
Previous slide
Next slide
Back to first slide
View graphic version