A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 809
- Type
- E - Conference contribution
- DOI
-
10.1145/3209108.3209162
- Title of conference / published proceedings
- LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
- First page
- 325
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Technical exception
- Month of publication
- July
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Solving parity games as well as mean-payoff games in polynomial time is a long-standing open problem. This paper is significant as it gives the fastest currently known algorithm to solve mean-payoff parity games. This work was presented at high ranked LICS 2018: IEEE Symposium on Logic in Computer Science and supported by the EPSRC grant EP/P020992/1.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
