Deciding Parity Games in Quasi-polynomial Time

Please use this identifier to cite or link to this item: https://doi.org/10.1137/17m1145288

DC Field	Value
dc.title	Deciding Parity Games in Quasi-polynomial Time
dc.contributor.author	Calude, Cristian S
dc.contributor.author	Jain, Sanjay
dc.contributor.author	Khoussainov, Bakhadyr
dc.contributor.author	Li, Wei
dc.contributor.author	Stephan, Frank
dc.date.accessioned	2022-07-13T05:05:14Z
dc.date.available	2022-07-13T05:05:14Z
dc.date.issued	2022-04
dc.identifier.citation	Calude, Cristian S, Jain, Sanjay, Khoussainov, Bakhadyr, Li, Wei, Stephan, Frank (2022-04). Deciding Parity Games in Quasi-polynomial Time. SIAM Journal on Computing 51 (2). ScholarBank@NUS Repository. https://doi.org/10.1137/17m1145288
dc.identifier.issn	00975397
dc.identifier.issn	10957111
dc.identifier.uri	https://scholarbank.nus.edu.sg/handle/10635/228381
dc.publisher	Society for Industrial & Applied Mathematics (SIAM)
dc.source	Elements
dc.type	Article
dc.date.updated	2022-07-12T07:41:26Z
dc.contributor.department	DEPARTMENT OF COMPUTER SCIENCE
dc.contributor.department	MATHEMATICS
dc.description.doi	10.1137/17m1145288
dc.description.sourcetitle	SIAM Journal on Computing
dc.description.volume	51
dc.description.issue	2
dc.published.state	Published
Appears in Collections:	Elements Staff Publications

File	Description	Size	Format	Access Settings	Version
paritygame.pdf		381.04 kB	Adobe PDF	OPEN	Post-print	View/Download

Check