עמוס ביימל

אקדמי בכיר

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

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.

שפת פרסום אנגלית
דפים 1150-1153
כתב עת Artificial Intelligence
כרך 173
נושא מספר 12-13
סטטוס פרסום פורסם - 01.08.2009

Keywords

Bayes network
Complexity
Max-k-connected

ASJC Scopus subject areas

Language and Linguistics
Linguistics and Language
Artificial Intelligence
גישה למסמך
10.1016/j.artint.2009.04.001
קבצים וקישורים אחרים
Link to publication in Scopus