NP-hardness of MAP in Ternary Tree Bayesian Networks

De Campos, Cassio Polpo (2013) NP-hardness of MAP in Ternary Tree Bayesian Networks. Technical Report. UNSPECIFIED.

[img] Text
IDSIA-06-13.pdf

Download (264Kb)

Abstract

This paper strengthens the NP-hardness result for the (partial) maximum a posteriori (MAP) problem in Bayesian networks with topology of trees (every variable has at most one parent) and variable cardinality at most three. MAP is the problem of querying the most probable state configuration of some (not necessarily all) of the network variables given evidence. It is demonstrated that the problem remains hard even in such simplistic networks.

Actions (login required)

View Item View Item