On the Complexity of Counter Reachability Games

DOI10.1007/978-3-642-41036-9_18zbMath1355.68196arXiv1307.5004OpenAlexW1729675287MaRDI QIDQ5168525

J. Reichert

Publication date: 7 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.5004

Mathematics Subject Classification ID

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 (1)

On Robot Games of Degree Two

This page was built for publication: On the Complexity of Counter Reachability Games