scientific article; zbMATH DE number 7455738
From MaRDI portal
Publication:5020998
Publication date: 11 January 2022
Full work available at URL: https://arxiv.org/abs/2009.10876
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Principles of distributed systems. 12th international conference, OPODIS 2008, Luxor, Egypt, December 15--18, 2008. Proceedings
- Symbolic model checking: \(10^{20}\) states and beyond
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- The complexity of mean payoff games on graphs
- Sylvan
- Monadic second-order logic on tree-like structures
- Binary decision diagrams in theory and practice
- Efficient manipulation of decision diagrams
- On the complexity of branching programs and decision trees for clique functions
- Deciding parity games in quasipolynomial time
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- Attracting tangles to solve parity games
