An ordered approach to solving parity games in quasi polynomial time and quasi linear space-Reference-Cited by-同舟云学术

An ordered approach to solving parity games in quasi polynomial time and quasi linear space

Published:2017-07-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software
language:
Short-container-title:

Author:

Fearnley John¹,Jain Sanjay²,Schewe Sven¹,Stephan Frank²,Wojtczak Dominik¹

Affiliation:

1. University of Liverpool, UK

2. National University of Singapore, Singapore

Funder

National University of Singapore

Engineering and Physical Sciences Research Council

Ministry of Education - Singapore

Publisher

ACM

Link

Reference53 articles.

2. Dietmar Berwanger Anuj Dawar Paul Hunter and Stephan Kreutzer. 2006. Dietmar Berwanger Anuj Dawar Paul Hunter and Stephan Kreutzer. 2006.

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

2. Justifications and a Reconstruction of Parity Game Solving Algorithms;Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems;2023

5. Improving parity games in practice;Annals of Mathematics and Artificial Intelligence;2021-01-23