« Back to Record
Citation APA

Le Roux, S., & Perez, G. A. (2018). The complexity of graph-based reductions for reachability in markov decision processes. Lecture notes in computer science, 10803 LNCS, 367-383. doi:10.1007/978-3-319-89366-2_20


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/270553

Le Roux, S., & Perez, G. A. (2018). The complexity of graph-based reductions for reachability in markov decision processes. Lecture notes in computer science, 10803 LNCS, 367-383. doi:10.1007/978-3-319-89366-2_20