Automata, Languages, and Programming
Springer Berlin Heidelberg
Chapter title |
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
|
---|---|
Chapter number | 15 |
Book title |
Automata, Languages, and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2015
|
DOI | 10.1007/978-3-662-47666-6_15 |
Book ISBNs |
978-3-66-247665-9, 978-3-66-247666-6
|
Authors |
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis, Etessami, Kousha, Stewart, Alistair, Yannakakis, Mihalis |
Country | Count | As % |
---|---|---|
Unknown | 15 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 27% |
Student > Master | 2 | 13% |
Researcher | 2 | 13% |
Other | 1 | 7% |
Professor | 1 | 7% |
Other | 3 | 20% |
Unknown | 2 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 9 | 60% |
Mathematics | 3 | 20% |
Physics and Astronomy | 1 | 7% |
Unknown | 2 | 13% |