"Approximate belief updating in max-2-connected Bayes networks is NP-hard."

Erez Karpas, Solomon Eyal Shimony, Amos Beimel (2009)

> Home

Details and statistics

DOI: 10.1016/J.ARTINT.2009.04.001

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ai/KarpasSB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/KarpasSB09
Erez Karpas, Solomon Eyal Shimony, Amos Beimel:
Approximate belief updating in max-2-connected Bayes networks is NP-hard. Artif. Intell. 173(12-13): 1150-1153 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.