Approximate belief updating in max-2-connected Bayes networks is NP-hard (Q840823)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5603685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate belief updating in max-2-connected Bayes networks is NP-hard |
scientific article; zbMATH DE number 5603685 |
Statements
Approximate belief updating in max-2-connected Bayes networks is NP-hard (English)
0 references
14 September 2009
0 references
Bayes network
0 references
complexity
0 references
max-\(k\)-connected
0 references
0.812096357345581
0 references
0.8065258860588074
0 references
0.8065258860588074
0 references
0.7891091704368591
0 references
