Etessami, Kousha, Stewart, Alistair, and Yannakakis, Mihalis. Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Retrieved from https://par.nsf.gov/biblio/10092269. Information and Computation 261.P2 Web. doi:10.1016/j.ic.2018.02.013.

Etessami, Kousha, Stewart, Alistair, & Yannakakis, Mihalis. Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. Information and Computation, 261 (P2). Retrieved from https://par.nsf.gov/biblio/10092269. https://doi.org/10.1016/j.ic.2018.02.013

Etessami, Kousha, Stewart, Alistair, and Yannakakis, Mihalis. "Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes". Information and Computation 261 (P2). Country unknown/Code not available. https://doi.org/10.1016/j.ic.2018.02.013. https://par.nsf.gov/biblio/10092269.

@article{osti_10092269,
place = {Country unknown/Code not available}, title = {Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes}, url = {https://par.nsf.gov/biblio/10092269}, DOI = {10.1016/j.ic.2018.02.013}, abstractNote = {}, journal = {Information and Computation}, volume = {261}, number = {P2}, author = {Etessami, Kousha and Stewart, Alistair and Yannakakis, Mihalis}, }