Approximating probabilistic inference in Bayesian belief networks is NP-hard. Dagum, P. & Luby, M. AIJ, 60:141–153, March, 1993. bibtex @article{Dagum+Luby:1993,
author = "Dagum, P. and Luby, M.",
year = "1993",
title = "Approximating probabilistic inference in {B}ayesian belief networks is {NP}-hard",
journal = aij,
volume = "60",
_number = "1",
month = mar,
pages = "141--153"
}
Downloads: 0
{"_id":{"_str":"534279620e946d920a0014fe"},"__v":1,"authorIDs":[],"author_short":["Dagum, P.","Luby, M."],"bibbaseid":"dagum-luby-approximatingprobabilisticinferenceinbayesianbeliefnetworksisnphard-1993","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Dagum"],"firstnames":["P."],"suffixes":[]},{"propositions":[],"lastnames":["Luby"],"firstnames":["M."],"suffixes":[]}],"year":"1993","title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","journal":"AIJ","volume":"60","_number":"1","month":"March","pages":"141–153","bibtex":"@article{Dagum+Luby:1993,\n\tauthor = \"Dagum, P. and Luby, M.\",\n\tyear = \"1993\",\n\ttitle = \"Approximating probabilistic inference in {B}ayesian belief networks is {NP}-hard\",\n\tjournal = aij,\n\tvolume = \"60\",\n\t_number = \"1\",\n\tmonth = mar,\n\tpages = \"141--153\"\n}\n\n","author_short":["Dagum, P.","Luby, M."],"key":"Dagum+Luby:1993","id":"Dagum+Luby:1993","bibbaseid":"dagum-luby-approximatingprobabilisticinferenceinbayesianbeliefnetworksisnphard-1993","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://aima.cs.berkeley.edu/aima4e.bib","downloads":0,"keywords":[],"search_terms":["approximating","probabilistic","inference","bayesian","belief","networks","hard","dagum","luby"],"title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","year":1993,"dataSources":["C5FtkvWWggFfMJTFX","cx4WvnDhXJhiLqdQo"]}