The Cost of Exactness in Quantitative Reachability
From MaRDI portal
Publication:5217310
DOI10.1007/978-3-319-63121-9_18zbMath1431.68073OpenAlexW2739079067MaRDI QIDQ5217310
Laurent Doyen, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 24 February 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-63121-9_18
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Probabilistic causes in Markov chains ⋮ Reachability games with relaxed energy constraints ⋮ Unnamed Item ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability
This page was built for publication: The Cost of Exactness in Quantitative Reachability