Computing best-possible bounds for the distribution of a sum of several variables is NP-hard

Vladik Kreinovich, Scott Ferson. Computing best-possible bounds for the distribution of a sum of several variables is NP-hard. Int. J. Approx. Reasoning, 41(3):331-342, 2006. [doi]

Abstract

Abstract is missing.