Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon. Updating credal networks is approximable in polynomial time. Int. J. Approx. Reasoning, 53(8):1183-1199, 2012. [doi]
@article{MauaCZ12,
title = {Updating credal networks is approximable in polynomial time},
author = {Denis Deratani Mauá and Cassio Polpo de Campos and Marco Zaffalon},
year = {2012},
doi = {10.1016/j.ijar.2012.06.014},
url = {http://dx.doi.org/10.1016/j.ijar.2012.06.014},
researchr = {https://researchr.org/publication/MauaCZ12},
cites = {0},
citedby = {0},
journal = {Int. J. Approx. Reasoning},
volume = {53},
number = {8},
pages = {1183-1199},
}