Deciding Parity Games in Quasi-polynomial Time
10.1137/17m1145288
Saved in:
Main Authors: | Calude, Cristian S, Jain, Sanjay, Khoussainov, Bakhadyr, Li, Wei, Stephan, Frank |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Article |
Published: |
Society for Industrial & Applied Mathematics (SIAM)
2022
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/228381 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
by: Fearnley J., et al.
Published: (2020) -
Learning a subclass of regular patterns in polynomial time
by: Case, J., et al.
Published: (2013) -
The Millennial Generation : Deciding Bloc?
by: Syafiq Hasyim
Published: (2018) -
Deciding on planning windows by partitioning time
for yard crane management in container terminals
by: Guo, Xi, et al.
Published: (2011) -
Clarifying Pascal's Wager: Charity as Decided
by: Valdez, Earl Allyson P.
Published: (2024)