Deciding Parity Games in Quasipolynomial Time

ResearchSpace/Manakin Repository

Show simple item record Calude, CS en Jain, S en Khoussainov, B en Li, W en Stephan, F en 2017-02-07T03:37:17Z en 2017-02-07T03:37:17Z en 2016 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-500 (2016) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract It is shown that the parity game can be solved in quasipolynomial time. The parameterised parity game (with n nodes and m distinct values) is proven to be in the class of fixed parameter tractable (FPT) problems (when parameterised over m). en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.source.uri en
dc.title Deciding Parity Games in Quasipolynomial Time en
dc.type Technical Report en
dc.subject.marsden Fields of Research en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Full text options

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace

Advanced Search