{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T09:59:48Z","timestamp":1766483988358,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,12]],"date-time":"1999-02-12T00:00:00Z","timestamp":918777600000},"content-version":"vor","delay-in-days":1017,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00158-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"161-183","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["On the complexity of partially observed Markov decision processes"],"prefix":"10.1016","volume":"157","author":[{"given":"Dima","family":"Burago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatol","family":"Slissenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1994","series-title":"First decisions of an optimal T-strategy can be non periodic","author":"Bcauquier","key":"10.1016\/0304-3975(95)00158-1_BIB1"},{"year":"1994","series-title":"On the complexity of finite memory strategies for control under probabilistic deviations","author":"Beauquier","key":"10.1016\/0304-3975(95)00158-1_BIB2"},{"year":"1976","series-title":"Dynamic Programming and Stochastic Control","author":"Bertsekas","key":"10.1016\/0304-3975(95)00158-1_BIB3"},{"year":"1987","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","key":"10.1016\/0304-3975(95)00158-1_BIB4"},{"key":"10.1016\/0304-3975(95)00158-1_BIB5","series-title":"Proc. 8th Symp. on Theoretical Aspects of Computer Science","first-page":"456","article-title":"The complexity of the Max Word problem","author":"Condon","year":"1991"},{"key":"10.1016\/0304-3975(95)00158-1_BIB6","series-title":"Proc. IEEE Internat. Conf. on Robotics and Automation","first-page":"2453","article-title":"A theory of robust planning","author":"de Rougemont","year":"1992"},{"key":"10.1016\/0304-3975(95)00158-1_BIB7","series-title":"Proc. 32nd Annu. Symp. on Foundations of Computer Science","first-page":"298","article-title":"How to learn an unknown environment","author":"Deng","year":"1991"},{"article-title":"V\u00e9rification probabiliste de probl\u00e8mes de graphes: applications \u00e0 la robotique mobile","year":"1993","author":"Diaz-Frias","key":"10.1016\/0304-3975(95)00158-1_BIB8"},{"volume":"Vol. 1","year":"1968","author":"Feller","key":"10.1016\/0304-3975(95)00158-1_BIB9"},{"year":"1979","author":"Garey","key":"10.1016\/0304-3975(95)00158-1_BIB10"},{"key":"10.1016\/0304-3975(95)00158-1_BIB11","first-page":"67","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"year":"1983","author":"Kallenberg","key":"10.1016\/0304-3975(95)00158-1_BIB12"},{"year":"1960","series-title":"Finite Markov Chains","author":"Kemeny","key":"10.1016\/0304-3975(95)00158-1_BIB13"},{"key":"10.1016\/0304-3975(95)00158-1_BIB14","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","article-title":"Games against nature","volume":"31","author":"Papadimitriou","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00158-1_BIB15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.12.3.441","article-title":"The complexity of Markov decision procedures","volume":"12","author":"Papadimitriou","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0304-3975(95)00158-1_BIB16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","article-title":"Shortest paths without a map","volume":"84","author":"Papadimitriou","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00158-1_BIB17","first-page":"331","article-title":"Markov decision processes","volume":"Vol. 2","author":"Puterman","year":"1990"},{"key":"10.1016\/0304-3975(95)00158-1_BIB18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"first-page":"34","year":"1992","author":"Zalgaller","key":"10.1016\/0304-3975(95)00158-1_BIB19"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:33Z","timestamp":1757477853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001581"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00158-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity of partially observed Markov decision processes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(95)00158-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}