{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:01Z","timestamp":1725490501073},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_34","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"388-399","source":"Crossref","is-referenced-by-count":2,"title":["The Computational Complexity of Monotonicity in Probabilistic Networks"],"prefix":"10.1007","author":[{"given":"Johan","family":"Kwisthout","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co, San Francisco (1979)"},{"key":"34_CR2","unstructured":"Kappen, B., Wiegerinck, W., Akay, E., Nijman, M., Neijt, J., van Beek, A.: Promedas: A diagnostic decision support system. In: Proceedings of the 15th Belgian-Dutch Conference on Artificial Intelligence (BNAIC 2003), pp. 455\u2013456 (2003)"},{"issue":"3","key":"34_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1017584715408","volume":"27","author":"M.L. Littman","year":"2001","unstructured":"Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic boolean satisfiability. Journal of Automated Reasoning\u00a027(3), 251\u2013296 (2001)","journal-title":"Journal of Automated Reasoning"},{"key":"34_CR4","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"34_CR5","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":"34_CR6","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"issue":"1-2","key":"34_CR7","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(1-2), 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"34_CR8","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(2), 399\u2013410 (1994)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/116825.116858","volume":"38","author":"J. Tor\u00e1n","year":"1991","unstructured":"Tor\u00e1n, J.: Complexity classes defined by counting quantifiers. Journal of the ACM\u00a038(3), 752\u2013773 (1991)","journal-title":"Journal of the ACM"},{"key":"34_CR10","unstructured":"Gaag, L.C.v.d., Bodlaender, H.L., Feelders, A.: Monotonicity in Bayesian networks. In: Twentieth Conference on Uncertainty in Artificial Intelligence, pp. 569\u2013576. AUAI Press (2004)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0933-3657(02)00012-X","volume":"25","author":"L.C.v.d. Gaag","year":"2002","unstructured":"Gaag, L.C.v.d., Renooij, S., Witteman, C.L.M., Aleman, B.M.P., Taa, B.G.: Probabilities for a probabilistic network: a case study in oesophageal cancer. Artificial Intelligence in Medicine\u00a025, 123\u2013148 (2002)","journal-title":"Artificial Intelligence in Medicine"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00289117","volume":"23","author":"K.W. Wagner","year":"1986","unstructured":"Wagner, K.W.: The complexity of combinatorial problems with succinct input representation. Acta Informatica\u00a023, 325\u2013356 (1986)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:19Z","timestamp":1619518519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}