Abstract
Exact inference problem in belief networks has been well studied in the literature and has various application areas. It is known that this problem and its approximation version are NP-hard. In this study, an alternative polynomial time transformation is provided from the well-known vertex cover problem. This new transformation may lead to new insights and polynomially solvable classes of the exact inference problem in Bayesian belief networks. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Tacettin, M., & Ünlüyurt, T. (2005). An alternative proof that exact inference problem in bayesian belief networks is NP-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3733 LNCS, pp. 947–955). https://doi.org/10.1007/11569596_96
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
