Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Attributed to:
Sublinear Algorithms for Approximating Probability Distributions
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-662-47666-6_15
Publication URI: http://dx.doi.org/10.1007/978-3-662-47666-6_15
Type: Book Chapter
Book Title: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II (2015)
Page Reference: 184-196
ISBN: 978-3-662-47665-9