Abstract

In this thesis, the computational complexity of a number of problems related to probabilistic networks is studied that combine probabilistic inference, finding, verifying, and enumerating solutions. In particular parameter tuning, sensitivity analysis, monotonicity, enumerating solutions, and problems related to qualitative abstractions of probabilistic networks are studied. These problems are not
... read more