Most relevant explanation: Computational complexity and approximation methods

DOI10.1007/S10472-011-9260-ZzbMath1234.68378OpenAlexW2017137564MaRDI QIDQ766267

Changhe Yuan, Heejin Lim, Michael L. Littman

Publication date: 23 March 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-011-9260-z

zbMATH Keywords

computational complexitylocal searchreversible jump MCMC\(\text{NP}^{\text{PP}}\)-completemost relevant explanation

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Hierarchical beam search for solving most relevant explanation in Bayesian networks

Cites Work

• Optimization by Simulated Annealing
• Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
• Likelihoodism, Bayesianism, and relational confirmation
• Computational Complexity of Probabilistic Turing Machines
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Most relevant explanation: Computational complexity and approximation methods