External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes

Stéphane Le Roux 0001, Guillermo A. Pérez. The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. In Christel Baier, Ugo Dal Lago, editors, Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Volume 10803 of Lecture Notes in Computer Science, pages 367-383, Springer, 2018. [doi]

Authors

Stéphane Le Roux 0001

This author has not been identified. Look up 'Stéphane Le Roux 0001' in Google

Guillermo A. Pérez

This author has not been identified. Look up 'Guillermo A. Pérez' in Google
runs on