Game Development Reference
In-Depth Information
2000 , Lecture Notes in Computer Science Nr. 1770, pages 290-301. Springer,
M. Jurdzinski. Deciding the winner in parity games is in UP
Co-UP. Information
Processing Letters , 68:119-124, 1998.
M. Jurdzinski, M. Paterson, and U. Zwick. A deterministic subexponential algorithm
for solving parity games. In Proceedings of ACM-SIAM Proceedings on Discrete
Algorithms, SODA 2006 , pages 117-123, 2006.
S. Kreutzer. Expressive equivalence of least and inflationary fixed point logic. Annals
of Pure and Applied Logic , 130:61-78, 2004.
D. Martin. Borel determinacy. Annals of Mathematics , 102:336-371, 1975.
A. Mostowski. Games with forbidden positions. Technical Report 78, University of
Gdansk, 1991.
M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theo-
retical Computer Science , 224:237-265, 1999.
M. Vardi. The complexity of relational query languages. In Proceedings of the 14th
ACM Symposium on the Theory of Computing , pages 137-146, 1982.
E. Zermelo. uber eine Anwendung der Mengenlehre auf die Theorie des Schach-
piels. In Proc. 5th Internat. Congr. Mathematicians , volume 2, pages 501-504,
Cambridge, 1913.
W. Zielonka. Infinite games on finitely coloured graphs with applications to automata
on infinite trees. Theoretical Computer Science , 200:135-183, 1998.
Search Nedrilad ::

Custom Search