On the complexity of partially observed Markov decision processes
type: Item
instance of: scholarly article
title: On the complexity of partially observed Markov decision processes
zbMATH Open document ID: 0871.68081
DOI: 10.1016/0304-3975(95)00158-1
author: Michel de Rougemont
author: Anatol Slissenko
author: Dmitri Burago
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 60J99
zbMATH DE Number: 984411
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00158-1
OpenAlex ID: W1970088948
cites work: Dynamic programming and stochastic control
cites work: Q4035692
cites work: Q5538132
cites work: Q4198056
cites work: Q4385525
cites work: Q4739658
cites work: Finite Continuous Time Markov Chains
cites work: Games against nature
cites work: The Complexity of Markov Decision Processes
cites work: Shortest paths without a map
cites work: Q4039670
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 984411