Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Volume 7391 of Lecture Notes in Computer Science, pages 314-326, Springer, 2012. [doi]
Abstract is missing.