Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi 0001, Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. Volume 9135 of Lecture Notes in Computer Science, pages 184-196, Springer, 2015. [doi]
Abstract is missing.