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

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. 
DOI: 10.1016/j.artint.2009.04.001

Topics

2 Figures and Tables

Slides referencing similar topics