"Updating credal networks is approximable in polynomial time."

Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon (2012)

> Home

Details and statistics

DOI: 10.1016/J.IJAR.2012.06.014

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ijar/MauaCZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijar/MauaCZ12
Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Updating credal networks is approximable in polynomial time. Int. J. Approx. Reason. 53(8): 1183-1199 (2012)

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.