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.


$1.99
Sales1
Views224
Comments0
  • CreatedFebruary 14, 2011
  • Files Included
Post your question
5000