b). The complexity of planning with partially-observable Markov deci¬
Mundhenk, M. (
sion processes (Tech. Rep. No. TR    - 76). Dartmouth College.

Mundhenk, M., Goldsmith, J., & Allender, E. (1997). The complexity of the policy existence problem for partially-observable finite-horizon Markov decision processes. In Proceedings 25th Mathematical Foundations of Computer Sciences conference (pp. 1 9 1 8).

Springer-Verlag.

Mundhenk, M., Goldsmith, J., Lusena, C., & Allender, E. (     ). Complexity results for finite-horizon Markov decision process problems. Journal of the ACM, 47 (4), 681  7 Papadimitriou, C. H. (1994). Computational complexity. Addison-Wesley. Papadimitriou, C. H., & Tsitsiklis, J. N. (1986). Intractable problems in control theory.

SIAM Journal of Control and Optimization, 24 (4), 6 9 654.

Papadimitriou, C. H., & Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12 ( ), 441–45 .

Peshkin, L., Meuleau, N., &   aelbling, L. P.  (1999).  Learning policies with external memory. In Proceedings of the 16th International Conference on Machine Learning 7 14). Morgan aufmann, San Francisco, CA.

(PP
Platzman, L. . (1977). Finite-memory estimation and control of finite probabilistic systems. Unpublished doctoral dissertation, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA.

Puterman, M. L. (1994). Markov decision processes. John Wiley & Sons, New York. Shamir, A. (199). IP = PSPACE. Journal of the ACM, 39(4), 869–877.

Smallwood, R. D., & Sondik, E. J. (197 ). The optimal control of partially observed Markov processes over the finite horizon. Operations Research, 21, 1 71 1 88.

Sondik, E. J. (1971). The optimal control of partially observable Markov processes. Unpublished doctoral dissertation, Stanford University.

Tsitsiklis, J. N., & Van Roy, B. (1996). Feature-based methods for large scale dynamic programming. Machine Learning, 22, 59–94.

White, C. C., III. (1991). Partially observed Markov decision processes: A survey. Annals of Operations  Research, 32,   15 hang, N. L., Lee, S. S., &   hang, W. (1999). A method for speeding up value iteration in partially obserable Markov decision processes. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (pp. 696 7 ).