scientific article; zbMATH DE number 7453080
From MaRDI portal
Publication:5020527
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1807.10210
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
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- An exponential lower bound for Cunningham's rule
- Results on the propositional \(\mu\)-calculus
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Solving parity games via priority promotion
- Automata, logics, and infinite games. A guide to current research
- Efficient parallel strategy improvement for parity games
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Solving Parity Games Using an Automata-Based Algorithm
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
- Non-oblivious Strategy Improvement
- Recursive algorithm for parity games requires exponential time
- An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
- Solving Parity Games in Practice
- The Complexity of All-switches Strategy Improvement
- Solving Parity Games via Priority Promotion
- Deciding parity games in quasipolynomial time
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- On model checking for the \(\mu\)-calculus and its fragments
- Attracting tangles to solve parity games
This page was built for publication:
