The Computational Complexity of Monotonicity in Probabilistic Networks
From MaRDI portal
Publication:5444978
DOI10.1007/978-3-540-74240-1_34zbMath1135.68443OpenAlexW2152720903MaRDI QIDQ5444978
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_34
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Same-decision probability: a confidence measure for threshold-based decisions ⋮ Most probable explanations in Bayesian networks: complexity and tractability ⋮ Attaining Monotonicity for Bayesian Networks ⋮ The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks
This page was built for publication: The Computational Complexity of Monotonicity in Probabilistic Networks
