Approximating MAPs for belief networks is NP-hard and other theorems (Q1274288): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Add wikidata reference. |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128081837 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating MAPs for belief networks is NP-hard and other theorems |
scientific article |
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
