The Complexity of Probabilistic Inference

Adnan DarwicheCambridge 2009 · DOI · OpenAlex

Abstract

We consider in this chapter the computational complexity of probabilistic inference. We also provide some reductions of probabilistic inference to well known problems, allowing us to benefit from specialized algorithms that have been developed for these problems.
BibTeX
@inproceedings{darwiche2009complexity,
  author = {Adnan Darwiche},
  title = {{The Complexity of Probabilistic Inference}},
  booktitle = {Cambridge},
  year = {2009},
  doi = {10.1017/cbo9780511811357.012},
}

Loading related content...

Figure