Approximating MAPs for belief networks is NP-hard and other theorems
- 1 June 1998
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 102 (1) , 21-38
- https://doi.org/10.1016/s0004-3702(98)00043-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding MAPs for belief networks is NP-hardArtificial Intelligence, 1994
- Cost-based abduction and MAP explanationArtificial Intelligence, 1994
- A linear constraint satisfaction approach to cost-based abductionArtificial Intelligence, 1994
- Approximating probabilistic inference in Bayesian belief networks is NP-hardArtificial Intelligence, 1993
- Belief networks revisitedArtificial Intelligence, 1993
- The computational complexity of probabilistic inference using bayesian belief networksArtificial Intelligence, 1990
- Evaluating Influence DiagramsOperations Research, 1986
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- Optimization by Simulated AnnealingScience, 1983
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975