Critical remarks on the computational complexity in probabilistic inference
From MaRDI portal
Recommendations
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- The computational complexity of probabilistic inference using Bayesian belief networks
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- An optimal approximation algorithm for Bayesian inference
- Finding MAPs for belief networks is NP-hard
This page was built for publication: Critical remarks on the computational complexity in probabilistic inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427068)