Robust worst cases for parity games algorithms
From MaRDI portal
Recommendations
Cites work
- A delayed promotion policy for parity games
- A deterministic subexponential algorithm for solving parity games
- A Deterministic Subexponential Algorithm for Solving Parity Games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Alternating tree automata, parity games, and modal -calculus
- Alternating-time temporal logic
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- ATL* Satisfiability Is 2EXPTIME-Complete
- Attracting tangles to solve parity games
- Automata, logics, and infinite games. A guide to current research
- Benchmark Graphs for Practical Graph Isomorphism
- Borel determinacy
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Deciding parity games in quasipolynomial time
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Fixed-point logics and solitaire games
- Graph isomorphism in quasipolynomial time (extended abstract)
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 5869590 (Why is no real title available?)
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- scientific article; zbMATH DE number 3993549 (Why is no real title available?)
- scientific article; zbMATH DE number 3993574 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Non-oblivious strategy improvement
- On model checking for the -calculus and its fragments
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Positional strategies for mean payoff games
- Reasoning about strategies
- Reasoning about strategies: on the model-checking problem
- Reasoning about strategies: on the satisfiability problem
- Reasoning About Substructures and Games
- Recursive algorithm for parity games requires exponential time
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Solving Parity Games in Big Steps
- Solving parity games in big steps
- Solving parity games in practice
- Solving parity games via priority promotion
- Solving parity games via priority promotion
- Strategy logic
- Substructure Temporal Logic
- Succinct progress measures for solving parity games
- The complexity of mean payoff games on graphs
- The complexity of stochastic games
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Cited in
(5)
This page was built for publication: Robust worst cases for parity games algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182730)
