Mundhenk, M., Goldsmith, J., Lusena, C., & Allender, E. (2000). Complexity of finitehorizon Markov decision processes problems. Journal of the ACM, 47**(4), 681–720.**
Papadimitriou, C., & Tsitsiklis, J. (1987). The complexity **of Markov decision processes.**
Mathematics of Operations Research, 12**(3), 441–450.**
Puterman, M. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming**. John Wiley & Sons.**
Stockmeyer, L. J. (1976). The polynomial-time hierarchy. **Theoretical Computer Science**,
3**, 1–22.**
Zhang, N., & Zhang, W. (2001). Speeding up the convergence of **value iteration in partially**
observable Markov decision processes. **Journal of Artificial Intelligence Research**, 14, 29–51.