For a world with
n boolean random variables, the chain rule has
n
terms. The
ith term has (
n -
i) evidence random variables,
which requires 2
n - i probability computations (or assignments). In
total, there are \(\sum_i 2^i = O(2^n)\) computations required.
This page last modified on 2006 January 24.