Tree-width and the computational complexity of MAP approximations in Bayesian networks (Q2941745)
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 6475333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree-width and the computational complexity of MAP approximations in Bayesian networks |
scientific article; zbMATH DE number 6475333 |
Statements
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (English)
0 references
25 August 2015
0 references
0.950873613357544
0 references
0.8157612085342407
0 references
0.8136293292045593
0 references
0.8136289119720459
0 references
