Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis. Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput., 261(Part):355-382, 2018. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision ProcessesKousha Etessami, Alistair Stewart, Mihalis Yannakakis. icalp 2015: 184-196 [doi] Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman EquationsKousha Etessami, Alistair Stewart, Mihalis Yannakakis. icalp 2012: 314-326 [doi] Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman EquationsKousha Etessami, Alistair Stewart, Mihalis Yannakakis. mor, 45(1):34-62, 2020. [doi]
The following publications are possibly variants of this publication: