Deciding Parity Games in Quasipolynomial Time

Calude, CS; Jain, S; Khoussainov, B; Li, W; Stephan, F

dc.contributor.author	Calude, CS	en
dc.contributor.author	Jain, S	en
dc.contributor.author	Khoussainov, B	en
dc.contributor.author	Li, W	en
dc.contributor.author	Stephan, F	en
dc.date.accessioned	2017-02-07T03:37:17Z	en
dc.date.available	2017-02-07T03:37:17Z	en
dc.date.issued	2016	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-500 (2016)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/31757	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	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	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	http://purl.org/eprint/accessRights/OpenAccess	en