On The Complexity of Counter Reachability Games*
From MaRDI portal
Publication:2968531
DOI10.3233/FI-2016-1320zbMath1357.68142OpenAlexW2583681957MaRDI QIDQ2968531
Publication date: 16 March 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2016-1320
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Countdown games, and simulation on (succinct) one-counter nets ⋮ Reachability games with relaxed energy constraints ⋮ Unnamed Item ⋮ On decidability and complexity of low-dimensional robot games
This page was built for publication: On The Complexity of Counter Reachability Games*
