The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes

On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence

Complexity of finite-horizon Markov decision process problems

Journal of the ACM (JACM)

On the undecidability of probabilistic planning and related stochastic optimization problems

Artificial Intelligence - special issue on planning with uncertainty and incomplete information

Nonapproximability results for partially observable Markov decision processes

Journal of Artificial Intelligence Research

The computational complexity of probabilistic planning

Journal of Artificial Intelligence Research