Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations.

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis

Browse the full ICALP paper archive.