KSL-90-21 + redirect page
Determination of the Entropy of a Belief Network is NP-Hard + Has identifier
Determination of the Entropy of a Belief Network is NP-Hard + Ksl tr id
Determination of the Entropy of a Belief Network is NP-Hard + Number
| Determination of the Entropy of a Belief Network is NP-Hard |
Bibtype
techreport
Has publishing details
June,1991
Has title
Determination of the Entropy of a Belief Network is NP-Hard
Has where published
KSL-90-21
Has year
1991
Title
Determination of the Entropy of a Belief Network is NP-Hard
Year
1991
Abstract
In this paper, we analyze the computationa … In this paper, we analyze the computational complexity of determining the entropy of an arbitrary probability distribution represented by a belief network, and show that this task is NP-hard in the number of nodes in the network. This analysis is similar to the analysis of the computational complexity of inference using belief networks. lexity of inference using belief networks.
Address
Stanford, CA, USA +
Author
Gregory F. Cooper and Edward Herskovits +
Has author
Gregory F. Cooper and Edward Herskovits +
Has identifier
Determination of the Entropy of a Belief Network is NP-Hard +
Institution
Knowledge Systems, AI Laboratory +
Ksl tr id
Determination of the Entropy of a Belief Network is NP-Hard +
Month
June +
Number
Determination of the Entropy of a Belief Network is NP-Hard +
Process note
NO +
Categories KSL Technical Report +, Publication +, Technical Report +
|
