{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:44:03Z","timestamp":1742388243434},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4619,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0004-3702(00)00076-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:55:14Z","timestamp":1027630514000},"page":"283-288","source":"Crossref","is-referenced-by-count":4,"title":["The complexity of approximating MAPs for belief networks with bounded probabilities"],"prefix":"10.1016","volume":"124","author":[{"given":"Ashraf M.","family":"Abdelbar","sequence":"first","affiliation":[]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"Sandra M.","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00076-X_BIB001","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(98)00043-5","article-title":"Approximating MAPs on belief networks is NP-hard and other theorems","volume":"102","author":"Abdelbar","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB002","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","article-title":"The computational complexity of probabilistic inference using Bayesian belief networks","volume":"42","author":"Cooper","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB003","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","volume":"60","author":"Dagum","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(97)00013-1","article-title":"An optimal approximation algorithm for Bayesian inference","volume":"93","author":"Dagum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB005","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB006","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB007","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","article-title":"Fusion, propagation, and structuring in belief networks","volume":"29","author":"Pearl","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB008","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"10.1016\/S0004-3702(00)00076-X_BIB009","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0004-3702(94)90072-8","article-title":"Finding MAPs for belief networks is NP-hard","volume":"68","author":"Shimony","year":"1994","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020000076X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020000076X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T23:25:47Z","timestamp":1555802747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437020000076X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S000437020000076X"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00076-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}