4.7 Article

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

Journal

ARTIFICIAL INTELLIGENCE
Volume 173, Issue 12-13, Pages 1150-1153

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.artint.2009.04.001

Keywords

Bayes network; Complexity; Max-k-connected

Ask authors/readers for more resources

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. (C) 2009 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available