## An alternative proof that exact inference problem in Bayesian belief networks is NP-hardTacettin, Mustafa and Ünlüyurt, Tonguç (2005) Full text not available from this repository. Official URL: http://dx.doi.org/10.1007/11569596 ## AbstractExact 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.
Repository Staff Only: item control page |