Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 810
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611975482.142
- Title of conference / published proceedings
- Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms
- First page
- 2333
- Volume
- 2019
- Issue
- -
- ISSN
- 1557-9468
- Open access status
- Technical exception
- Month of publication
- January
- Year of publication
- 2019
- 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
-
5
- 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. Our paper is significant as it shows the limitations of these works: they can all be phrased under a common framework and this framework cannot give faster algorithms. Follow-up outside the community by a Russian team (https://arxiv.org/abs/1902.07175) using communication complexity. This work was supported by the EPSRC grant EP/P020992/1 and one of the author was supported by The Alan Turing Institute under the EPSRC grant EP/N510129/1.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
