The Strahler number of a parity game
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 845
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.ICALP.2020.123
- Title of conference / published proceedings
- 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
- First page
- 123:1
- Volume
- 168
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2020
- 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
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Solving parity games in polynomial time is a long-standing open problem. Recent breakthroughs have exhibited quasi-polynomial time algorithms - starting with a best paper award at STOC 2017 for Calude et al. This paper is significant as it gives new insights and unexpected links between a number of the techniques exhibited in recent research, e.g. universal trees (Czerwinski et al, SODA 2019), register games (Lehtinen, LICS 2018), progress measures (Jurdzinski et al, STACS 2000, LICS 2017).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
