Approximate belief updating in max-2-connected Bayes networks is NP-hard
type: Item
instance of: scholarly article
title: Approximate belief updating in max-2-connected Bayes networks is NP-hard
zbMATH Open document ID: 1191.68683
author: E. Karpas
author: Amos Beimel
author: Solomon E. Shimony
published in: Artificial Intelligence
publication date: 2009-09-14T00:00:00Z
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 5603685
zbMATH Keywords: Bayes network
zbMATH Keywords: complexity
zbMATH Keywords: max-\(k\)-connected
MaRDI profile type: Publication
full work available at URL: j.artint.2009.04.001
OpenAlex ID: W2038679483
Wikidata QID: Q57518737
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Q4198056
cites work: Finding MAPs for belief networks is NP-hard
cites work: Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
DOI: 10.1016/J.ARTINT.2009.04.001
description: scientific article; zbMATH DE number 5603685