Approximating MAPs for belief networks is NP-hard and other theorems (Q1274288)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating MAPs for belief networks is NP-hard and other theorems |
scientific article; zbMATH DE number 1238314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating MAPs for belief networks is NP-hard and other theorems |
scientific article; zbMATH DE number 1238314 |
Statements
Approximating MAPs for belief networks is NP-hard and other theorems (English)
0 references
12 January 1999
0 references
Bayesian belief networks
0 references
dynamic abduction
0 references
next-best explanation
0 references
probabilistic reasoning
0 references
uncertainty
0 references
complexity
0 references
satisfiability
0 references
0.9546076
0 references
0.9480665
0 references
0.9226768
0 references
0.89282084
0 references
0.89002675
0 references
0 references
0.8734962
0 references
