The complexity of request-response games

DOI10.1007/978-3-642-21254-3_17MaRDI QIDQ3004582zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Memory Reduction for Strategies in Infinite Games
• Time-Optimal Winning Strategies for Poset Games
• Mathematical Foundations of Computer Science 2005

Cited in

(5)

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

This page was built for publication: The complexity of request-response games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004582)