Publication
Title
The complexity of graph-based reductions for reachability in Markov decision processes
Author
Le Roux, Stéphane
Pérez, Guillermo A.
Abstract
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Source (book)
21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, April 1420, 2018, Thessaloniki, Greece / Baier, Christel [edit.]; et al.
Source (series)
Theoretical computer science and general issues (LNTCS) ; 10803
Publication
Cham
:
Springer
,
2018
ISBN
978-3-319-89365-5
978-3-319-89366-2
Volume/pages
10803(2018), p. 367-383
Full text (Publisher's DOI)
https://doi.org/10.1007/978-3-319-89366-2_20
Full text (open access)
https://repository.uantwerpen.be/docman/irua/37cebc/154977.pdf
UAntwerpen
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Research group
Antwerp Systems and software Modelling (AnSyMo)
Publication type
A1 Journal article
Subject
Engineering sciences. Technology
Computer. Automation
External links
Record
Identification
Creation
19.11.2018
Last edited
20.11.2018