The Complexity of Request-Response Games

DOI10.1007/978-3-642-21254-3_17zbMath1330.68105OpenAlexW86633464MaRDI QIDQ3004582

Krishnendu Chatterjee, Florian Horn, Thomas A. Henzinger

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Finite-state strategies in delay games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Timed games with bounded window parity objectives

This page was built for publication: The Complexity of Request-Response Games