Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. (English) Zbl 1394.60085 Inf. Comput. 261, Part 2, 355-382 (2018). MSC: 60J80 PDF BibTeX XML Cite \textit{K. Etessami} et al., Inf. Comput. 261, Part 2, 355--382 (2018; Zbl 1394.60085) Full Text: DOI
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. (English) Zbl 1394.60084 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47665-9/pbk; 978-3-662-47666-6/ebook). Lecture Notes in Computer Science 9135, 184-196 (2015). MSC: 60J80 PDF BibTeX XML Cite \textit{K. Etessami} et al., Lect. Notes Comput. Sci. 9135, 184--196 (2015; Zbl 1394.60084) Full Text: DOI arXiv