The computational complexity of probabilistic planning

Journal of Artificial Intelligence Research

Volumn 9, Issue , 1998, Pages 1-36

  Littman, Michael L ^a   Goldsmith, Judy ^b   Mundhenk, Martin ^c  

^a Duke University   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

^c UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11544375673     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.505     Document Type: Article

References (9)

1. Allender, E., & Ogihara, M. (1996). Relationships among PL, #L, and the determinant. Theoretical Informatics and Applications, 30(1), 1-21.
2. Àlvarez, C., & Jenner, B. (1993). A very hard log-space counting class. Theoretical Computer Science, 107, 3-30.
3. Bäckström, C. (1995). Expressive equivalence of planning formalisms. Artificial Intelligence, 76(1-2), 17-34.
4. Bäckström, C., & Nebel, B. (1995). Complexity results for SAS+ planning. Computational Intelligence, 11(4), 625-655.
5. Smith, D. E., & Williamson, M. (1995). Representation and evaluation of plans with loops. Working notes for the 1995 Stanford Spring Symposium on Extended Theories of Action.
6. Tesauro, G. (1994). TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6(2), 215-219.
7. Toda, S. (1991). PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20, 865-877.
8. Torán, J. (1991). Complexity classes defined by counting quantifiers. Journal of the ACM, 38(3), 753-774.
9. Vinay, V. (1991). Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Structure in Complexity Theory Conference, pp. 270-284. IEEE.