The Complexity of Partial-Observation Parity Games
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 1-14
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Algorithms for Omega-Regular Games with Imperfect InformationLogical Methods in Computer Science, 2007
- Alternating-time temporal logicJournal of the ACM, 2002
- Fair SimulationInformation and Computation, 2002
- The determinacy of Blackwell gamesThe Journal of Symbolic Logic, 1998
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- Supervisory Control of a Class of Discrete Event ProcessesSIAM Journal on Control and Optimization, 1987
- The complexity of two-player games of incomplete informationJournal of Computer and System Sciences, 1984
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Borel DeterminacyAnnals of Mathematics, 1975
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969