{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:54Z","timestamp":1725574074516},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_30","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T11:01:51Z","timestamp":1294138911000},"page":"356-367","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks"],"prefix":"10.1007","author":[{"given":"Johan H. P.","family":"Kwisthout","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]},{"given":"Linda C.","family":"van der Gaag","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.eswa.2007.11.065","volume":"26","author":"T. Charitos","year":"2009","unstructured":"Charitos, T., van der Gaag, L.C., Visscher, S., Schurink, C.A.M., Lucas, P.J.F.: A dynamic Bayesian network for diagnosing ventilator-associated pneumonia in ICU patients. Expert Systems with Applications\u00a026, 1249\u20131258 (2009)","journal-title":"Expert Systems with Applications"},{"key":"30_CR2","unstructured":"Geenen, P.L., Elbers, A.R.W., van der Gaag, L.C., Loeffen, W.L.A.: Development of a probabilistic network for clinical detection of classical swine fever. In: Proceedings of the 11th Symposium of the International Society for Veterinary Epidemiology and Economics, Cairns, Australia, pp. 667\u2013669 (2006)"},{"key":"30_CR3","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Palo Alto (1988)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/0004-3702(94)90072-8","volume":"68","author":"S.E. Shimony","year":"1994","unstructured":"Shimony, S.E.: Finding MAPs for belief networks is NP-hard. Artificial Intelligence\u00a068, 399\u2013410 (1994)","journal-title":"Artificial Intelligence"},{"key":"30_CR6","first-page":"675","volume-title":"Proceedings of the 15th European Conference on Artificial Intelligence","author":"H.L. Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., van den Eijkhof, F., van der Gaag, L.C.: On the complexity of the MPA problem in probabilistic networks. In: van Harmelen, F. (ed.) Proceedings of the 15th European Conference on Artificial Intelligence, pp. 675\u2013679. IOS Press, Amsterdam (2002)"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1613\/jair.1236","volume":"21","author":"J.D. Park","year":"2004","unstructured":"Park, J.D., Darwiche, A.: Complexity results and approximation settings for MAP explanations. Journal of Artificial Intelligence Research\u00a021, 101\u2013133 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"30_CR8","first-page":"345","volume":"66","author":"E. Charniak","year":"1994","unstructured":"Charniak, E., Shimony, S.E.: Cost-based abduction and MAP explanation. Acta Informatica\u00a066, 345\u2013374 (1994)","journal-title":"Acta Informatica"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(98)00043-5","volume":"102","author":"A. Abdelbar","year":"1998","unstructured":"Abdelbar, A., Hedetniemi, S.: Approximating MAPs for belief networks is NP-hard and other theorems. Artificial Intelligence\u00a0102, 21\u201338 (1998)","journal-title":"Artificial Intelligence"},{"key":"30_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68282-2","volume-title":"Bayesian Networks and Decision Graphs","author":"F.V. Jensen","year":"2007","unstructured":"Jensen, F.V., Nielsen, T.D.: Bayesian Networks and Decision Graphs. Springer, New York (2007)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/62.322435","volume":"31","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H.: On the complexity of unique solutions. Journal of the ACM\u00a031, 392\u2013400 (1984)","journal-title":"Journal of the ACM"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"M.W. Krentel","year":"1988","unstructured":"Krentel, M.W.: The complexity of optimization problems. Journal of Computer and System Sciences\u00a036, 490\u2013509 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(05)80082-0","volume":"49","author":"S. Toda","year":"1994","unstructured":"Toda, S.: Simple characterizations of P(#P) and complete problems. Journal of Computer and System Sciences\u00a049, 1\u201317 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR14","unstructured":"Kwisthout, J.H.P.: The Computational Complexity of Probabilistic Networks. PhD thesis, Universiteit Utrecht (2009)"},{"key":"30_CR15","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T06:55:41Z","timestamp":1553324141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}