Deciding parity games in quasipolynomial time
From MaRDI portal
(Redirected from Publication:4977976)
Recommendations
Cited in
(only showing first 100 items - show all)- Adaptive strategies for rLTL games
- The GKK algorithm is the fastest over simple mean-payoff games
- Universal algorithms for parity games and nested fixpoints
- Alternating traps in Muller and parity games
- Synthesizing Optimally Resilient Controllers
- scientific article; zbMATH DE number 7447732 (Why is no real title available?)
- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- Succinct progress measures for solving parity games
- Improving parity games in practice
- scientific article; zbMATH DE number 7559118 (Why is no real title available?)
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- scientific article; zbMATH DE number 7649916 (Why is no real title available?)
- Bounded game-theoretic semantics for modal mu-calculus
- Deciding Parity Games in Quasi-polynomial Time
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- Real equation systems with alternating fixed-points
- On the complexity of rational verification
- Timed games with bounded window parity objectives
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- Winning strategy templates for stochastic parity games towards permissive and resilient control
- On Nash-solvability of n-person graphical games under Markov and a-priori realizations
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- A parity game tale of two counters
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Church synthesis on register automata over linearly ordered data domains
- A brief excursion to parity games
- Church synthesis on register automata over linearly ordered data domains
- The complexity of all-switches strategy improvement
- The Theory of Universal Graphs for Infinite Duration Games
- Solving parity games via priority promotion
- Controlling a population
- scientific article; zbMATH DE number 7649927 (Why is no real title available?)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- Abstract tropical linear programming
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Combinations of Qualitative Winning for Stochastic Parity Games
- Hyperplane separation technique for multidimensional mean-payoff games
- Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints
- Complexity results for modal logic with recursion via translations and tableaux
- Operations on fixpoint equation systems
- _1 and the modal -calculus
- Window parity games: an alternative approach toward parity games with time bounds
- Parity games with weights
- Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Parity to safety in polynomial time for pushdown and collapsible pushdown systems
- Linear temporal logic -- from infinite to finite horizon
- A cure for stuttering parity games
- Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
- A delayed promotion policy for parity games
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- The alternating-time -calculus with disjunctive explicit strategies
- A quasi-polynomial black-box algorithm for fixed point evaluation
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Deterministic and game separability for regular languages of infinite trees
- Higher-order model checking step by step
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Game-based local model checking for the coalgebraic \(\mu\)-calculus
- The Strahler number of a parity game
- Priority promotion with Parysian flair
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
- Quasipolynomial computation of nested fixpoints
- Reachability games and parity games
- The worst-case complexity of symmetric strategy improvement
- Parity games on temporal graphs
- Symbolic solution of Emerson-Lei games for reactive synthesis
- Synthesis with privacy against an observer
- Approximating the minimal lookahead needed to win infinite games
- scientific article; zbMATH DE number 7447737 (Why is no real title available?)
- scientific article; zbMATH DE number 7649926 (Why is no real title available?)
- A computation model with automatic functions and relations as primitive operations
- Robust, expressive, and quantitative linear temporal logics: pick any two for free
- Synthesis of Data Word Transducers
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- New algorithms for combinations of objectives using separating automata
- On the size of disjunctive formulas in the \(\mu\)-calculus
- Size measures and alphabetic equivalence in the -calculus
- An existence theorem of Nash equilibrium in Coq and Isabelle
- Cooking Your Own Parity Game Preorders Through Matching Plays
- Synthesis with privacy against an observer
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- Width of non-deterministic automata
- Time and parallelizability results for parity games with bounded treewidth
- Strategy templates for almost-sure and positive winning of stochastic parity games towards permissive and resilient control
- Finite-state strategies in delay games
- Robust worst cases for parity games algorithms
- Perspective games
- Computing the width of non-deterministic automata
- Finite-state strategies in delay games
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Exponential time algorithms for deciding regular games
- Justifications and a reconstruction of parity game solving algorithms
- Infinite-duration poorman-bidding games
- Synthesizing optimally resilient controllers
- On the Way to Alternating Weak Automata
- Beyond value iteration for parity games: strategy iteration with universal trees
This page was built for publication: Deciding parity games in quasipolynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977976)
