"Polynomial Time Algorithms for Branching Markov Decision Processes and ..."

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis (2012)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1202-4798
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1202-4798
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. CoRR abs/1202.4798 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.