Prof. Amos Beimel
Know all about my research
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.
| Publication language | English |
| Pages | 1150-1153 |
| Journal | Artificial Intelligence |
| Volume | 173 |
| Issue number | 12-13 |
| Publication status | Published - 01.08.2009 |
Keywords
Bayes network
Complexity
Max-k-connected
ASJC Scopus subject areas
Language and Linguistics
Linguistics and Language
Artificial Intelligence
