Updating credal networks is approximable in polynomial time

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]

Authors

Denis Deratani Mauá

This author has not been identified. Look up 'Denis Deratani Mauá' in Google

Cassio Polpo de Campos

This author has not been identified. Look up 'Cassio Polpo de Campos' in Google

Marco Zaffalon

This author has not been identified. Look up 'Marco Zaffalon' in Google