Deciding parity games in quasipolynomial time-Reference-Cited by-同舟云学术

Deciding parity games in quasipolynomial time

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Calude Cristian S.¹,Jain Sanjay²,Khoussainov Bakhadyr¹,Li Wei²,Stephan Frank²

Affiliation:

1. University of Auckland, New Zealand

2. National University of Singapore, Singapore

Funder

Ministry of Education of Singapore

Royal Society of New Zealand

National University of Singapore

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055409

Reference64 articles.

1. On the menbership problem for functional and multivalued dependencies in relational databases

2. from parity games to safety games. RAIRO - Theoretical Informatics and Applications;Bernet Julien;EDP Sciences,2002

3. Fixed-Point Logics and Solitaire Games

4. Henrik Björklund Sven Sandberg and Sergei Vorobyov. On fixed-parameter complexity of infinite games. Technical report 2003-038 Department of Information Technology Uppsala University Box 337 SE-751 05 Uppsala Sweden. Henrik Björklund Sven Sandberg and Sergei Vorobyov. On fixed-parameter complexity of infinite games. Technical report 2003-038 Department of Information Technology Uppsala University Box 337 SE-751 05 Uppsala Sweden.

5. Memoryless determinacy of parity and mean payoff games: a simple proof

Cited by 100 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DFAMiner: Mining Minimal Separating DFAs from Labelled Samples;Lecture Notes in Computer Science;2024-09-13

2. Operations on Fixpoint Equation Systems;Logical Methods in Computer Science;2024-07-10

3. Perspective Games;ACM Transactions on Computational Logic;2024-01-17

4. Most General Winning Secure Equilibria Synthesis in Graph Games;Lecture Notes in Computer Science;2024

5. NeuroSynt: A Neuro-symbolic Portfolio Solver for Reactive Synthesis;Lecture Notes in Computer Science;2024