{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T09:10:56Z","timestamp":1779268256196,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602460","type":"print"},{"value":"9783540447689","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60246-1_125","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:55:12Z","timestamp":1330278912000},"page":"191-200","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of finite memory policies for Markov decision processes"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Beauquier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dima","family":"Burago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatol","family":"Slissenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","volume-title":"Dynamic Programming and Stochastic Control","author":"D. P. Bertsekas","year":"1976","unstructured":"D. P. Bertsekas. Dynamic Programming and Stochastic Control. Academic Press, New York, 1976."},{"key":"17_CR2","unstructured":"D. Burago, M. de Rougemont, and A. Slissenko. On the complexity of partially observed Markov decision processes. 19p., accepted to Theor. Comput. Sci., 1995."},{"key":"17_CR3","volume-title":"Automata, Languages and Machines","author":"C. J. Eilenberg","year":"1974","unstructured":"C. J. Eilenberg. Automata, Languages and Machines. Academic Press, New York, 1974. Vol. A."},{"key":"17_CR4","volume-title":"Technical Report 148","author":"L.C.M. Kallenberg","year":"1983","unstructured":"L.C.M. Kallenberg. Linear programming and finite Markovian control problems. Technical Report 148, Mathematics Centrum Tract, Amsterdam, 1983."},{"issue":"3","key":"17_CR5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"C. H. Papadimitriou","year":"1987","unstructured":"C. H. Papadimitriou and J. N. Tsitsiklis. The complexity of Markov decision procedures. Mathematics of Operations Research, 12(3):441\u2013450, 1987.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"M.L. Puterman. Markov decision processes. In D.P. Heyman and M.J. Sobel, editors, Handbooks in Operations Research and Management Science. Stochastic Models, pages 331\u2013434. North Holland, 1990. Vol. 2.","DOI":"10.1016\/S0927-0507(05)80172-0"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60246-1_125.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:29Z","timestamp":1605646589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60246-1_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602460","9783540447689"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-60246-1_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}