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]
@article{EtessamiSY18,
title = {Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes},
author = {Kousha Etessami and Alistair Stewart and Mihalis Yannakakis},
year = {2018},
doi = {10.1016/j.ic.2018.02.013},
url = {https://doi.org/10.1016/j.ic.2018.02.013},
researchr = {https://researchr.org/publication/EtessamiSY18},
cites = {0},
citedby = {0},
journal = {Inf. Comput.},
volume = {261},
number = {Part},
pages = {355-382},
}