Journal of Artificial Intelligence 42(2):393--405. Dagum, P., and Luby, M. 1993. Approximating probabilistic inference in Bayesian networks is NP-hard.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Models of Continual Computation - Eric Horvitz (1997) (22 citations) (Correct)
No context found.
Journal of Artificial Intelligence 42(2):393--405. Dagum, P., and Luby, M. 1993. Approximating probabilistic inference in Bayesian networks is NP-hard.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC