# Question

Investigate the complexity of exact inference in general Bayesian networks:

a. Prove that any 3-SAT problem can be reduced to exact inference in a Bayesian network constructed to represent the particular problem and hence that exact inference is NP- hard.

b. The problem of counting the number of satisfying assignments for a 3-SAT problem is #P-complete. Show that exact inference is at least as hard as this.

a. Prove that any 3-SAT problem can be reduced to exact inference in a Bayesian network constructed to represent the particular problem and hence that exact inference is NP- hard.

b. The problem of counting the number of satisfying assignments for a 3-SAT problem is #P-complete. Show that exact inference is at least as hard as this.

## Answer to relevant Questions

Consider the problem of generating a random sample Iron, a specified distribution on a single variable. You can assume that a random number generator is available that returns a random number uniformly distributed between 0 ...Show that any second-order Markov process can be rewritten as a first-order Markov process with an augmented set of state variables. Can this always he done parsimoniously that is, without increasing the number of parameters ...In this exercise, we analyze in more detail the persistent-failure model for the battery sensor in Figure (a). a. Figure (b) stops at t = 32. Describe qualitatively what should happen as t → ∞ if the sensor ...How much is a micro-mort worth to you? Devise a protocol to determine this. Ask questions based both on paying to avoid risk and being paid to accept risk.Can any finite search problem be translated exactly into a Markov decision problem such that an optimal solution of the latter is also an optimal solution of the former? If so, explain precisely how to translate the problem ...Post your question

0